modularize repo, use pnpm, improve typechecking

37 files changed, 2112 insertions, 3639 deletions

diff --git a/packages/idb-bridge/.vscode/settings.json b/packages/idb-bridge/.vscode/settings.json
deleted file mode 100644
index ec71f9aae..000000000
--- a/packages/idb-bridge/.vscode/settings.json
+++ /dev/null
@@ -1,4 +0,0 @@
-{
-    "editor.tabSize": 2,
-    "typescript.tsdk": "node_modules/typescript/lib"
-}
\ No newline at end of file
diff --git a/packages/idb-bridge/package.json b/packages/idb-bridge/package.json
index b0aa74a71..b2c22921f 100644
--- a/packages/idb-bridge/package.json
+++ b/packages/idb-bridge/package.json
@@ -2,17 +2,31 @@
   "name": "idb-bridge",
   "version": "0.0.15",
   "description": "IndexedDB implementation that uses SQLite3 as storage",
-  "main": "./build/index.js",
-  "types": "./build/index.d.ts",
+  "main": "./dist/idb-bridge.js",
+  "module": "./lib/index.js",
+  "types": "./lib/index.d.ts",
   "author": "Florian Dold",
   "license": "AGPL-3.0-or-later",
   "private": false,
   "scripts": {
     "test": "tsc && ava",
-    "build": "tsc"
+    "compile": "tsc && rollup -c",
+    "clean": "rimraf dist lib",
+    "pretty": "prettier --config ../../.prettierrc --write src"
   },
   "devDependencies": {
-    "ava": "2.3.0",
+    "@rollup/plugin-typescript": "^5.0.2",
+    "ava": "^3.10.1",
+    "esm": "^3.2.25",
+    "rimraf": "^3.0.2",
+    "rollup": "^2.23.0",
     "typescript": "^3.7.0"
+  },
+  "dependencies": {
+    "@types/node": "^14.0.27",
+    "tslib": "^2.0.0"
+  },
+  "ava": {
+    "require": ["esm"]
   }
 }
diff --git a/packages/idb-bridge/rollup.config.js b/packages/idb-bridge/rollup.config.js
new file mode 100644
index 000000000..76214f22d
--- /dev/null
+++ b/packages/idb-bridge/rollup.config.js
@@ -0,0 +1,31 @@
+// rollup.config.js
+import commonjs from "@rollup/plugin-commonjs";
+import nodeResolve from "@rollup/plugin-node-resolve";
+import json from "@rollup/plugin-json";
+import builtins from "builtin-modules";
+import pkg from "./package.json";
+
+export default {
+  input: "lib/index.js",
+  output: {
+    file: pkg.main,
+    format: "cjs",
+    sourcemap: true
+  },
+  external: builtins,
+  plugins: [
+    nodeResolve({
+      preferBuiltins: true,
+    }),
+
+    commonjs({
+      include: [/node_modules/],
+      extensions: [".js", ".ts"],
+      ignoreGlobal: false,
+      sourceMap: false,
+    }),
+
+    json(),
+  ],
+}
+
diff --git a/packages/idb-bridge/src/BridgeIDBCursor.ts b/packages/idb-bridge/src/BridgeIDBCursor.ts
index ebf71da0d..a85f41f2b 100644
--- a/packages/idb-bridge/src/BridgeIDBCursor.ts
+++ b/packages/idb-bridge/src/BridgeIDBCursor.ts
@@ -16,9 +16,9 @@
  permissions and limitations under the License.
  */
 
-import BridgeIDBKeyRange from "./BridgeIDBKeyRange";
-import BridgeIDBObjectStore from "./BridgeIDBObjectStore";
-import BridgeIDBRequest from "./BridgeIDBRequest";
+import { BridgeIDBKeyRange } from "./BridgeIDBKeyRange";
+import { BridgeIDBObjectStore } from "./BridgeIDBObjectStore";
+import { BridgeIDBRequest } from "./BridgeIDBRequest";
 import compareKeys from "./util/cmp";
 import {
   DataError,
@@ -42,7 +42,7 @@ import {
   RecordStoreRequest,
   StoreLevel,
 } from "./backend-interface";
-import BridgeIDBFactory from "./BridgeIDBFactory";
+import { BridgeIDBFactory } from "./BridgeIDBFactory";
 
 /**
  * http://www.w3.org/TR/2015/REC-IndexedDB-20150108/#cursor
@@ -136,7 +136,8 @@ export class BridgeIDBCursor {
       console.log(
         `iterating cursor os=${this._objectStoreName},idx=${this._indexName}`,
       );
-    BridgeIDBFactory.enableTracing && console.log("cursor type ", this.toString());
+    BridgeIDBFactory.enableTracing &&
+      console.log("cursor type ", this.toString());
     const recordGetRequest: RecordGetRequest = {
       direction: this.direction,
       indexName: this._indexName,
@@ -232,7 +233,7 @@ export class BridgeIDBCursor {
 
     const operation = async () => {
       if (BridgeIDBFactory.enableTracing) {
-        console.log("updating at cursor")
+        console.log("updating at cursor");
       }
       const { btx } = this.source._confirmActiveTransaction();
       await this._backend.storeRecord(btx, storeReq);
@@ -359,5 +360,3 @@ export class BridgeIDBCursor {
     return "[object IDBCursor]";
   }
 }
-
-export default BridgeIDBCursor;
diff --git a/packages/idb-bridge/src/BridgeIDBCursorWithValue.ts b/packages/idb-bridge/src/BridgeIDBCursorWithValue.ts
index d75bd21e6..8561879cf 100644
--- a/packages/idb-bridge/src/BridgeIDBCursorWithValue.ts
+++ b/packages/idb-bridge/src/BridgeIDBCursorWithValue.ts
@@ -14,7 +14,7 @@
  permissions and limitations under the License.
  */
 
-import BridgeIDBCursor from "./BridgeIDBCursor";
+import { BridgeIDBCursor } from "./BridgeIDBCursor";
 import {
   CursorRange,
   CursorSource,
@@ -22,7 +22,7 @@ import {
   Value,
 } from "./util/types";
 
-class BridgeIDBCursorWithValue extends BridgeIDBCursor {
+export class BridgeIDBCursorWithValue extends BridgeIDBCursor {
   get value(): Value {
     return this._value;
   }
@@ -46,5 +46,3 @@ class BridgeIDBCursorWithValue extends BridgeIDBCursor {
     return "[object IDBCursorWithValue]";
   }
 }
-
-export default BridgeIDBCursorWithValue;
diff --git a/packages/idb-bridge/src/BridgeIDBDatabase.ts b/packages/idb-bridge/src/BridgeIDBDatabase.ts
index bc2e8acca..a22ad5400 100644
--- a/packages/idb-bridge/src/BridgeIDBDatabase.ts
+++ b/packages/idb-bridge/src/BridgeIDBDatabase.ts
@@ -14,7 +14,7 @@
  * permissions and limitations under the License.
  */
 
-import BridgeIDBTransaction from "./BridgeIDBTransaction";
+import { BridgeIDBTransaction } from "./BridgeIDBTransaction";
 import {
   ConstraintError,
   InvalidAccessError,
@@ -61,9 +61,8 @@ const confirmActiveVersionchangeTransaction = (database: BridgeIDBDatabase) => {
   return transaction;
 };
 
-
 // http://www.w3.org/TR/2015/REC-IndexedDB-20150108/#database-interface
-class BridgeIDBDatabase extends FakeEventTarget {
+export class BridgeIDBDatabase extends FakeEventTarget {
   _closePending = false;
   _closed = false;
   _runningVersionchangeTransaction = false;
@@ -152,7 +151,12 @@ class BridgeIDBDatabase extends FakeEventTarget {
       throw new InvalidAccessError();
     }
 
-    transaction._backend.createObjectStore(backendTx, name, keyPath, autoIncrement);
+    transaction._backend.createObjectStore(
+      backendTx,
+      name,
+      keyPath,
+      autoIncrement,
+    );
 
     this._schema = this._backend.getSchema(this._backendConnection);
 
@@ -212,7 +216,12 @@ class BridgeIDBDatabase extends FakeEventTarget {
       }
     }
 
-    const tx = new BridgeIDBTransaction(storeNames, mode, this, backendTransaction);
+    const tx = new BridgeIDBTransaction(
+      storeNames,
+      mode,
+      this,
+      backendTransaction,
+    );
     this._transactions.push(tx);
     queueTask(() => tx._start());
     return tx;
@@ -236,5 +245,3 @@ class BridgeIDBDatabase extends FakeEventTarget {
     return "[object IDBDatabase]";
   }
 }
-
-export default BridgeIDBDatabase;
diff --git a/packages/idb-bridge/src/BridgeIDBFactory.ts b/packages/idb-bridge/src/BridgeIDBFactory.ts
index 0fbcd7630..7002222d8 100644
--- a/packages/idb-bridge/src/BridgeIDBFactory.ts
+++ b/packages/idb-bridge/src/BridgeIDBFactory.ts
@@ -15,9 +15,9 @@
  * permissions and limitations under the License.
  */
 
-import BridgeIDBDatabase from "./BridgeIDBDatabase";
-import BridgeIDBOpenDBRequest from "./BridgeIDBOpenDBRequest";
-import BridgeIDBVersionChangeEvent from "./BridgeIDBVersionChangeEvent";
+import { BridgeIDBDatabase } from "./BridgeIDBDatabase";
+import { BridgeIDBOpenDBRequest } from "./BridgeIDBOpenDBRequest";
+import { BridgeIDBVersionChangeEvent } from "./BridgeIDBVersionChangeEvent";
 import compareKeys from "./util/cmp";
 import enforceRange from "./util/enforceRange";
 import { AbortError, VersionError } from "./util/errors";
@@ -44,7 +44,7 @@ export class BridgeIDBFactory {
 
     queueTask(async () => {
       const databases = await this.backend.getDatabases();
-      const dbInfo = databases.find(x => x.name == name);
+      const dbInfo = databases.find((x) => x.name == name);
       if (!dbInfo) {
         // Database already doesn't exist, success!
         const event = new BridgeIDBVersionChangeEvent("success", {
@@ -219,8 +219,6 @@ export class BridgeIDBFactory {
   }
 
   private _anyOpen(): boolean {
-    return this.connections.some(c => !c._closed && !c._closePending);
+    return this.connections.some((c) => !c._closed && !c._closePending);
   }
 }
-
-export default BridgeIDBFactory;
diff --git a/packages/idb-bridge/src/BridgeIDBIndex.ts b/packages/idb-bridge/src/BridgeIDBIndex.ts
index 5be80ba71..3c1b39435 100644
--- a/packages/idb-bridge/src/BridgeIDBIndex.ts
+++ b/packages/idb-bridge/src/BridgeIDBIndex.ts
@@ -15,11 +15,11 @@
  permissions and limitations under the License.
  */
 
-import BridgeIDBCursor from "./BridgeIDBCursor";
-import BridgeIDBCursorWithValue from "./BridgeIDBCursorWithValue";
-import BridgeIDBKeyRange from "./BridgeIDBKeyRange";
-import BridgeIDBObjectStore from "./BridgeIDBObjectStore";
-import BridgeIDBRequest from "./BridgeIDBRequest";
+import { BridgeIDBCursor } from "./BridgeIDBCursor";
+import { BridgeIDBCursorWithValue } from "./BridgeIDBCursorWithValue";
+import { BridgeIDBKeyRange } from "./BridgeIDBKeyRange";
+import { BridgeIDBObjectStore } from "./BridgeIDBObjectStore";
+import { BridgeIDBRequest } from "./BridgeIDBRequest";
 import {
   ConstraintError,
   InvalidStateError,
@@ -27,7 +27,7 @@ import {
 } from "./util/errors";
 import { BridgeIDBCursorDirection, Key, KeyPath } from "./util/types";
 import valueToKey from "./util/valueToKey";
-import BridgeIDBTransaction from "./BridgeIDBTransaction";
+import { BridgeIDBTransaction } from "./BridgeIDBTransaction";
 import {
   Schema,
   Backend,
@@ -59,15 +59,18 @@ export class BridgeIDBIndex {
   }
 
   get keyPath(): KeyPath {
-    return this._schema.objectStores[this.objectStore.name].indexes[this._name].keyPath;
+    return this._schema.objectStores[this.objectStore.name].indexes[this._name]
+      .keyPath;
   }
 
   get multiEntry(): boolean {
-    return this._schema.objectStores[this.objectStore.name].indexes[this._name].multiEntry;
+    return this._schema.objectStores[this.objectStore.name].indexes[this._name]
+      .multiEntry;
   }
 
   get unique(): boolean {
-    return this._schema.objectStores[this.objectStore.name].indexes[this._name].unique;
+    return this._schema.objectStores[this.objectStore.name].indexes[this._name]
+      .unique;
   }
 
   get _backend(): Backend {
@@ -305,7 +308,6 @@ export class BridgeIDBIndex {
       operation,
       source: this,
     });
-
   }
 
   public toString() {
diff --git a/packages/idb-bridge/src/BridgeIDBKeyRange.ts b/packages/idb-bridge/src/BridgeIDBKeyRange.ts
index 4055e092a..43f59fb14 100644
--- a/packages/idb-bridge/src/BridgeIDBKeyRange.ts
+++ b/packages/idb-bridge/src/BridgeIDBKeyRange.ts
@@ -21,7 +21,7 @@ import { Key } from "./util/types";
 import valueToKey from "./util/valueToKey";
 
 // http://www.w3.org/TR/2015/REC-IndexedDB-20150108/#range-concept
-class BridgeIDBKeyRange {
+export class BridgeIDBKeyRange {
   public static only(value: Key) {
     if (arguments.length === 0) {
       throw new TypeError();
@@ -128,5 +128,3 @@ class BridgeIDBKeyRange {
     return BridgeIDBKeyRange.only(key);
   }
 }
-
-export default BridgeIDBKeyRange;
diff --git a/packages/idb-bridge/src/BridgeIDBObjectStore.ts b/packages/idb-bridge/src/BridgeIDBObjectStore.ts
index bb84b4454..a32c29275 100644
--- a/packages/idb-bridge/src/BridgeIDBObjectStore.ts
+++ b/packages/idb-bridge/src/BridgeIDBObjectStore.ts
@@ -15,12 +15,12 @@
  permissions and limitations under the License.
  */
 
-import BridgeIDBCursor from "./BridgeIDBCursor";
-import BridgeIDBCursorWithValue from "./BridgeIDBCursorWithValue";
-import BridgeIDBIndex from "./BridgeIDBIndex";
-import BridgeIDBKeyRange from "./BridgeIDBKeyRange";
-import BridgeIDBRequest from "./BridgeIDBRequest";
-import BridgeIDBTransaction from "./BridgeIDBTransaction";
+import { BridgeIDBCursor } from "./BridgeIDBCursor";
+import { BridgeIDBCursorWithValue } from "./BridgeIDBCursorWithValue";
+import { BridgeIDBIndex } from "./BridgeIDBIndex";
+import { BridgeIDBKeyRange } from "./BridgeIDBKeyRange";
+import { BridgeIDBRequest } from "./BridgeIDBRequest";
+import { BridgeIDBTransaction } from "./BridgeIDBTransaction";
 
 import {
   ConstraintError,
@@ -44,10 +44,10 @@ import {
   ResultLevel,
   StoreLevel,
 } from "./backend-interface";
-import BridgeIDBFactory from "./BridgeIDBFactory";
+import { BridgeIDBFactory } from "./BridgeIDBFactory";
 
 // http://www.w3.org/TR/2015/REC-IndexedDB-20150108/#object-store
-class BridgeIDBObjectStore {
+export class BridgeIDBObjectStore {
   _indexesCache: Map<string, BridgeIDBIndex> = new Map();
 
   transaction: BridgeIDBTransaction;
@@ -455,5 +455,3 @@ class BridgeIDBObjectStore {
     return "[object IDBObjectStore]";
   }
 }
-
-export default BridgeIDBObjectStore;
diff --git a/packages/idb-bridge/src/BridgeIDBOpenDBRequest.ts b/packages/idb-bridge/src/BridgeIDBOpenDBRequest.ts
index 7b636193f..71a6495e5 100644
--- a/packages/idb-bridge/src/BridgeIDBOpenDBRequest.ts
+++ b/packages/idb-bridge/src/BridgeIDBOpenDBRequest.ts
@@ -15,22 +15,20 @@
   permissions and limitations under the License.
 */
 
-import BridgeIDBRequest from "./BridgeIDBRequest";
+import { BridgeIDBRequest } from "./BridgeIDBRequest";
 import { EventCallback } from "./util/types";
 
-class BridgeIDBOpenDBRequest extends BridgeIDBRequest {
-    public onupgradeneeded: EventCallback | null = null;
-    public onblocked: EventCallback | null = null;
+export class BridgeIDBOpenDBRequest extends BridgeIDBRequest {
+  public onupgradeneeded: EventCallback | null = null;
+  public onblocked: EventCallback | null = null;
 
-    constructor() {
-      super();
-      // https://www.w3.org/TR/IndexedDB/#open-requests
-      this.source = null;
-    }
+  constructor() {
+    super();
+    // https://www.w3.org/TR/IndexedDB/#open-requests
+    this.source = null;
+  }
 
-    public toString() {
-        return "[object IDBOpenDBRequest]";
-    }
+  public toString() {
+    return "[object IDBOpenDBRequest]";
+  }
 }
-
-export default BridgeIDBOpenDBRequest;
diff --git a/packages/idb-bridge/src/BridgeIDBRequest.ts b/packages/idb-bridge/src/BridgeIDBRequest.ts
index 1a6bdf501..3ed2f9244 100644
--- a/packages/idb-bridge/src/BridgeIDBRequest.ts
+++ b/packages/idb-bridge/src/BridgeIDBRequest.ts
@@ -15,19 +15,19 @@
  * permissions and limitations under the License.
  */
 
-import BridgeFDBCursor from "./BridgeIDBCursor";
-import BridgeIDBIndex from "./BridgeIDBIndex";
-import BridgeIDBObjectStore from "./BridgeIDBObjectStore";
-import BridgeIDBTransaction from "./BridgeIDBTransaction";
+import { BridgeIDBCursor as BridgeFIBCursor } from "./BridgeIDBCursor";
+import { BridgeIDBIndex } from "./BridgeIDBIndex";
+import { BridgeIDBObjectStore } from "./BridgeIDBObjectStore";
+import { BridgeIDBTransaction } from "./BridgeIDBTransaction";
 import { InvalidStateError } from "./util/errors";
 import FakeEventTarget from "./util/FakeEventTarget";
 import { EventCallback } from "./util/types";
 import FakeEvent from "./util/FakeEvent";
 
-class BridgeIDBRequest extends FakeEventTarget {
+export class BridgeIDBRequest extends FakeEventTarget {
   _result: any = null;
   _error: Error | null | undefined = null;
-  source: BridgeFDBCursor | BridgeIDBIndex | BridgeIDBObjectStore | null = null;
+  source: BridgeFIBCursor | BridgeIDBIndex | BridgeIDBObjectStore | null = null;
   transaction: BridgeIDBTransaction | null = null;
   readyState: "done" | "pending" = "pending";
   onsuccess: EventCallback | null = null;
@@ -83,5 +83,3 @@ class BridgeIDBRequest extends FakeEventTarget {
     this.dispatchEvent(event);
   }
 }
-
-export default BridgeIDBRequest;
diff --git a/packages/idb-bridge/src/BridgeIDBTransaction.ts b/packages/idb-bridge/src/BridgeIDBTransaction.ts
index 250e27149..56a4d59ef 100644
--- a/packages/idb-bridge/src/BridgeIDBTransaction.ts
+++ b/packages/idb-bridge/src/BridgeIDBTransaction.ts
@@ -1,6 +1,6 @@
-import BridgeIDBDatabase from "./BridgeIDBDatabase";
-import BridgeIDBObjectStore from "./BridgeIDBObjectStore";
-import BridgeIDBRequest from "./BridgeIDBRequest";
+import { BridgeIDBDatabase } from "./BridgeIDBDatabase";
+import { BridgeIDBObjectStore } from "./BridgeIDBObjectStore";
+import { BridgeIDBRequest } from "./BridgeIDBRequest";
 import {
   AbortError,
   InvalidStateError,
@@ -19,11 +19,10 @@ import {
 import queueTask from "./util/queueTask";
 import openPromise from "./util/openPromise";
 import { DatabaseTransaction, Backend } from "./backend-interface";
-import { array } from "prop-types";
-import BridgeIDBFactory from "./BridgeIDBFactory";
+import { BridgeIDBFactory } from "./BridgeIDBFactory";
 
 // http://www.w3.org/TR/2015/REC-IndexedDB-20150108/#transaction
-class BridgeIDBTransaction extends FakeEventTarget {
+export class BridgeIDBTransaction extends FakeEventTarget {
   public _state: "active" | "inactive" | "committing" | "finished" = "active";
   public _started = false;
   public _objectStoresCache: Map<string, BridgeIDBObjectStore> = new Map();
@@ -328,5 +327,3 @@ class BridgeIDBTransaction extends FakeEventTarget {
     return this._waitPromise;
   }
 }
-
-export default BridgeIDBTransaction;
diff --git a/packages/idb-bridge/src/BridgeIDBVersionChangeEvent.ts b/packages/idb-bridge/src/BridgeIDBVersionChangeEvent.ts
index 6fc63ee35..43e822d86 100644
--- a/packages/idb-bridge/src/BridgeIDBVersionChangeEvent.ts
+++ b/packages/idb-bridge/src/BridgeIDBVersionChangeEvent.ts
@@ -17,25 +17,23 @@
 
 import FakeEvent from "./util/FakeEvent";
 
-class BridgeIDBVersionChangeEvent extends FakeEvent {
-    public newVersion: number | null;
-    public oldVersion: number;
-
-    constructor(
-        type: "blocked" | "success" | "upgradeneeded" | "versionchange",
-        parameters: { newVersion?: number | null; oldVersion?: number } = {},
-    ) {
-        super(type);
-
-        this.newVersion =
-            parameters.newVersion !== undefined ? parameters.newVersion : null;
-        this.oldVersion =
-            parameters.oldVersion !== undefined ? parameters.oldVersion : 0;
-    }
-
-    public toString() {
-        return "[object IDBVersionChangeEvent]";
-    }
+export class BridgeIDBVersionChangeEvent extends FakeEvent {
+  public newVersion: number | null;
+  public oldVersion: number;
+
+  constructor(
+    type: "blocked" | "success" | "upgradeneeded" | "versionchange",
+    parameters: { newVersion?: number | null; oldVersion?: number } = {},
+  ) {
+    super(type);
+
+    this.newVersion =
+      parameters.newVersion !== undefined ? parameters.newVersion : null;
+    this.oldVersion =
+      parameters.oldVersion !== undefined ? parameters.oldVersion : 0;
+  }
+
+  public toString() {
+    return "[object IDBVersionChangeEvent]";
+  }
 }
-
-export default BridgeIDBVersionChangeEvent;
diff --git a/packages/idb-bridge/src/MemoryBackend.test.ts b/packages/idb-bridge/src/MemoryBackend.test.ts
index a48fafb1e..21325379d 100644
--- a/packages/idb-bridge/src/MemoryBackend.test.ts
+++ b/packages/idb-bridge/src/MemoryBackend.test.ts
@@ -14,15 +14,14 @@
  permissions and limitations under the License.
  */
 
-
 import test from "ava";
 import MemoryBackend from "./MemoryBackend";
-import BridgeIDBFactory from "./BridgeIDBFactory";
-import BridgeIDBRequest from "./BridgeIDBRequest";
-import BridgeIDBDatabase from "./BridgeIDBDatabase";
-import BridgeIDBTransaction from "./BridgeIDBTransaction";
-import BridgeIDBKeyRange from "./BridgeIDBKeyRange";
-import BridgeIDBCursorWithValue from "./BridgeIDBCursorWithValue";
+import { BridgeIDBFactory } from "./BridgeIDBFactory";
+import { BridgeIDBRequest } from "./BridgeIDBRequest";
+import { BridgeIDBDatabase } from "./BridgeIDBDatabase";
+import { BridgeIDBTransaction } from "./BridgeIDBTransaction";
+import { BridgeIDBKeyRange } from "./BridgeIDBKeyRange";
+import { BridgeIDBCursorWithValue } from "./BridgeIDBCursorWithValue";
 
 function promiseFromRequest(request: BridgeIDBRequest): Promise<any> {
   return new Promise((resolve, reject) => {
@@ -48,7 +47,7 @@ function promiseFromTransaction(
   });
 }
 
-test("Spec: Example 1 Part 1", async t => {
+test("Spec: Example 1 Part 1", async (t) => {
   const backend = new MemoryBackend();
   const idb = new BridgeIDBFactory(backend);
 
@@ -69,7 +68,7 @@ test("Spec: Example 1 Part 1", async t => {
   t.pass();
 });
 
-test("Spec: Example 1 Part 2", async t => {
+test("Spec: Example 1 Part 2", async (t) => {
   const backend = new MemoryBackend();
   const idb = new BridgeIDBFactory(backend);
 
@@ -101,7 +100,7 @@ test("Spec: Example 1 Part 2", async t => {
   t.pass();
 });
 
-test("Spec: Example 1 Part 3", async t => {
+test("Spec: Example 1 Part 3", async (t) => {
   const backend = new MemoryBackend();
   const idb = new BridgeIDBFactory(backend);
 
@@ -229,7 +228,6 @@ test("Spec: Example 1 Part 3", async t => {
   cursor = request6.result;
   t.is(cursor, null);
 
-
   const request7 = index5.openCursor(null, "prevunique");
   await promiseFromRequest(request7);
   cursor = request7.result;
@@ -251,8 +249,7 @@ test("Spec: Example 1 Part 3", async t => {
   t.pass();
 });
 
-
-test("simple deletion", async t => {
+test("simple deletion", async (t) => {
   const backend = new MemoryBackend();
   const idb = new BridgeIDBFactory(backend);
 
@@ -307,8 +304,7 @@ test("simple deletion", async t => {
   t.pass();
 });
 
-
-test("export", async t => {
+test("export", async (t) => {
   const backend = new MemoryBackend();
   const idb = new BridgeIDBFactory(backend);
 
@@ -322,7 +318,6 @@ test("export", async t => {
 
   const db: BridgeIDBDatabase = await promiseFromRequest(request);
 
-
   const tx = db.transaction("books", "readwrite");
   tx.oncomplete = () => {
     console.log("oncomplete called");
@@ -341,10 +336,13 @@ test("export", async t => {
   backend2.importDump(exportedData);
   const exportedData2 = backend2.exportDump();
 
-  t.assert(exportedData.databases["library"].objectStores["books"].records.length === 3);
+  t.assert(
+    exportedData.databases["library"].objectStores["books"].records.length ===
+      3,
+  );
   t.deepEqual(exportedData, exportedData2);
 
   t.is(exportedData.databases["library"].schema.databaseVersion, 42);
   t.is(exportedData2.databases["library"].schema.databaseVersion, 42);
   t.pass();
-});
\ No newline at end of file
+});
diff --git a/packages/idb-bridge/src/MemoryBackend.ts b/packages/idb-bridge/src/MemoryBackend.ts
index 08103d722..c5fac41a9 100644
--- a/packages/idb-bridge/src/MemoryBackend.ts
+++ b/packages/idb-bridge/src/MemoryBackend.ts
@@ -40,7 +40,7 @@ import { Key, Value, KeyPath } from "./util/types";
 import { StoreKeyResult, makeStoreKeyValue } from "./util/makeStoreKeyValue";
 import getIndexKeys from "./util/getIndexKeys";
 import openPromise from "./util/openPromise";
-import BridgeIDBKeyRange from "./BridgeIDBKeyRange";
+import { BridgeIDBKeyRange } from "./BridgeIDBKeyRange";
 
 enum TransactionLevel {
   Disconnected = 0,
@@ -863,9 +863,9 @@ export class MemoryBackend implements Backend {
       !db.txRestrictObjectStores.includes(objectStoreName)
     ) {
       throw Error(
-        `Not allowed to access store '${
-          objectStoreName
-        }', transaction is over ${JSON.stringify(db.txRestrictObjectStores)}`,
+        `Not allowed to access store '${objectStoreName}', transaction is over ${JSON.stringify(
+          db.txRestrictObjectStores,
+        )}`,
       );
     }
     if (typeof range !== "object") {
@@ -986,7 +986,7 @@ export class MemoryBackend implements Backend {
         throw Error("db inconsistent: expected index entry missing");
       }
       const newPrimaryKeys = existingRecord.primaryKeys.filter(
-        x => compareKeys(x, primaryKey) !== 0,
+        (x) => compareKeys(x, primaryKey) !== 0,
       );
       if (newPrimaryKeys.length === 0) {
         index.modifiedData = indexData.without(indexKey);
diff --git a/packages/idb-bridge/src/backend-interface.ts b/packages/idb-bridge/src/backend-interface.ts
index bcb1e8a85..3617d21bc 100644
--- a/packages/idb-bridge/src/backend-interface.ts
+++ b/packages/idb-bridge/src/backend-interface.ts
@@ -22,7 +22,7 @@ import {
   KeyPath,
   BridgeIDBDatabaseInfo,
 } from "./util/types";
-import BridgeIDBKeyRange from "./BridgeIDBKeyRange";
+import { BridgeIDBKeyRange } from "./BridgeIDBKeyRange";
 
 export interface ObjectStoreProperties {
   keyPath: KeyPath | null;
@@ -76,7 +76,7 @@ export interface RecordGetRequest {
    * Last cursor position in terms of the index key.
    * Can only be specified if indexName is defined and
    * lastObjectStorePosition is defined.
-   * 
+   *
    * Must either be undefined or within range.
    */
   lastIndexPosition?: Key;
@@ -87,7 +87,7 @@ export interface RecordGetRequest {
   /**
    * If specified, the index key of the results must be
    * greater or equal to advanceIndexKey.
-   * 
+   *
    * Only applicable if indexName is specified.
    */
   advanceIndexKey?: Key;
@@ -144,7 +144,7 @@ export interface Backend {
   /**
    * Even though the standard interface for indexedDB doesn't require
    * the client to run deleteDatabase in a version transaction, there is
-   * implicitly one running. 
+   * implicitly one running.
    */
   deleteDatabase(btx: DatabaseTransaction, name: string): Promise<void>;
 
@@ -152,9 +152,18 @@ export interface Backend {
 
   getSchema(db: DatabaseConnection): Schema;
 
-  renameIndex(btx: DatabaseTransaction, objectStoreName: string, oldName: string, newName: string): void;
+  renameIndex(
+    btx: DatabaseTransaction,
+    objectStoreName: string,
+    oldName: string,
+    newName: string,
+  ): void;
 
-  deleteIndex(btx: DatabaseTransaction, objectStoreName: string, indexName: string): void;
+  deleteIndex(
+    btx: DatabaseTransaction,
+    objectStoreName: string,
+    indexName: string,
+  ): void;
 
   rollback(btx: DatabaseTransaction): Promise<void>;
 
diff --git a/packages/idb-bridge/src/idbtypes.ts b/packages/idb-bridge/src/idbtypes.ts
new file mode 100644
index 000000000..53f93d451
--- /dev/null
+++ b/packages/idb-bridge/src/idbtypes.ts
@@ -0,0 +1,736 @@
+/*! *****************************************************************************
+Copyright (c) Microsoft Corporation. All rights reserved.
+Licensed under the Apache License, Version 2.0 (the "License"); you may not use
+this file except in compliance with the License. You may obtain a copy of the
+License at http://www.apache.org/licenses/LICENSE-2.0
+
+THIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
+KIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED
+WARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,
+MERCHANTABLITY OR NON-INFRINGEMENT.
+
+See the Apache Version 2.0 License for specific language governing permissions
+and limitations under the License.
+***************************************************************************** */
+
+/**
+ * Type declarations for IndexedDB, adapted from the TypeScript lib.dom.d.ts.
+ *
+ * Instead of ambient types, we export type declarations.
+ */
+
+export type IDBKeyPath = string;
+
+export interface EventListener {
+  (evt: Event): void;
+}
+
+export interface EventListenerObject {
+  handleEvent(evt: Event): void;
+}
+
+export interface EventListenerOptions {
+  capture?: boolean;
+}
+
+export interface AddEventListenerOptions extends EventListenerOptions {
+  once?: boolean;
+  passive?: boolean;
+}
+
+export type IDBTransactionMode = "readonly" | "readwrite" | "versionchange";
+
+export type EventListenerOrEventListenerObject =
+  | EventListener
+  | EventListenerObject;
+
+/** EventTarget is a DOM interface implemented by objects that can receive events and may have listeners for them. */
+export interface EventTarget {
+  /**
+   * Appends an event listener for events whose type attribute value is type. The callback argument sets the callback that will be invoked when the event is dispatched.
+   *
+   * The options argument sets listener-specific options. For compatibility this can be a boolean, in which case the method behaves exactly as if the value was specified as options's capture.
+   *
+   * When set to true, options's capture prevents callback from being invoked when the event's eventPhase attribute value is BUBBLING_PHASE. When false (or not present), callback will not be invoked when event's eventPhase attribute value is CAPTURING_PHASE. Either way, callback will be invoked if event's eventPhase attribute value is AT_TARGET.
+   *
+   * When set to true, options's passive indicates that the callback will not cancel the event by invoking preventDefault(). This is used to enable performance optimizations described in § 2.8 Observing event listeners.
+   *
+   * When set to true, options's once indicates that the callback will only be invoked once after which the event listener will be removed.
+   *
+   * The event listener is appended to target's event listener list and is not appended if it has the same type, callback, and capture.
+   */
+  addEventListener(
+    type: string,
+    listener: EventListenerOrEventListenerObject | null,
+    options?: boolean | AddEventListenerOptions,
+  ): void;
+  /**
+   * Dispatches a synthetic event event to target and returns true if either event's cancelable attribute value is false or its preventDefault() method was not invoked, and false otherwise.
+   */
+  dispatchEvent(event: Event): boolean;
+  /**
+   * Removes the event listener in target's event listener list with the same type, callback, and options.
+   */
+  removeEventListener(
+    type: string,
+    callback: EventListenerOrEventListenerObject | null,
+    options?: EventListenerOptions | boolean,
+  ): void;
+}
+
+/** An event which takes place in the DOM. */
+export interface Event {
+  /**
+   * Returns true or false depending on how event was initialized. True if event goes through its target's ancestors in reverse tree order, and false otherwise.
+   */
+  readonly bubbles: boolean;
+  cancelBubble: boolean;
+  /**
+   * Returns true or false depending on how event was initialized. Its return value does not always carry meaning, but true can indicate that part of the operation during which event was dispatched, can be canceled by invoking the preventDefault() method.
+   */
+  readonly cancelable: boolean;
+  /**
+   * Returns true or false depending on how event was initialized. True if event invokes listeners past a ShadowRoot node that is the root of its target, and false otherwise.
+   */
+  readonly composed: boolean;
+  /**
+   * Returns the object whose event listener's callback is currently being invoked.
+   */
+  readonly currentTarget: EventTarget | null;
+  /**
+   * Returns true if preventDefault() was invoked successfully to indicate cancelation, and false otherwise.
+   */
+  readonly defaultPrevented: boolean;
+  /**
+   * Returns the event's phase, which is one of NONE, CAPTURING_PHASE, AT_TARGET, and BUBBLING_PHASE.
+   */
+  readonly eventPhase: number;
+  /**
+   * Returns true if event was dispatched by the user agent, and false otherwise.
+   */
+  readonly isTrusted: boolean;
+  returnValue: boolean;
+  /** @deprecated */
+  readonly srcElement: EventTarget | null;
+  /**
+   * Returns the object to which event is dispatched (its target).
+   */
+  readonly target: EventTarget | null;
+  /**
+   * Returns the event's timestamp as the number of milliseconds measured relative to the time origin.
+   */
+  readonly timeStamp: number;
+  /**
+   * Returns the type of event, e.g. "click", "hashchange", or "submit".
+   */
+  readonly type: string;
+  /**
+   * Returns the invocation target objects of event's path (objects on which listeners will be invoked), except for any nodes in shadow trees of which the shadow root's mode is "closed" that are not reachable from event's currentTarget.
+   */
+  composedPath(): EventTarget[];
+  initEvent(type: string, bubbles?: boolean, cancelable?: boolean): void;
+  /**
+   * If invoked when the cancelable attribute value is true, and while executing a listener for the event with passive set to false, signals to the operation that caused event to be dispatched that it needs to be canceled.
+   */
+  preventDefault(): void;
+  /**
+   * Invoking this method prevents event from reaching any registered event listeners after the current one finishes running and, when dispatched in a tree, also prevents event from reaching any other objects.
+   */
+  stopImmediatePropagation(): void;
+  /**
+   * When dispatched in a tree, invoking this method prevents event from reaching any objects other than the current object.
+   */
+  stopPropagation(): void;
+  readonly AT_TARGET: number;
+  readonly BUBBLING_PHASE: number;
+  readonly CAPTURING_PHASE: number;
+  readonly NONE: number;
+}
+
+/** A type returned by some APIs which contains a list of DOMString (strings). */
+export interface DOMStringList {
+  /**
+   * Returns the number of strings in strings.
+   */
+  readonly length: number;
+  /**
+   * Returns true if strings contains string, and false otherwise.
+   */
+  contains(string: string): boolean;
+  /**
+   * Returns the string with index index from strings.
+   */
+  item(index: number): string | null;
+  [index: number]: string;
+}
+
+export type BufferSource = ArrayBufferView | ArrayBuffer;
+
+export type IDBValidKey = number | string | Date | BufferSource | IDBArrayKey;
+
+export interface IDBIndexParameters {
+  multiEntry?: boolean;
+  unique?: boolean;
+}
+
+export interface IDBObjectStoreParameters {
+  autoIncrement?: boolean;
+  keyPath?: string | string[] | null;
+}
+
+export interface EventInit {
+  bubbles?: boolean;
+  cancelable?: boolean;
+  composed?: boolean;
+}
+
+export interface IDBArrayKey extends Array<IDBValidKey> {}
+
+export type IDBCursorDirection = "next" | "nextunique" | "prev" | "prevunique";
+
+/** This IndexedDB API interface represents a cursor for traversing or iterating over multiple records in a database. */
+export interface IDBCursor {
+  /**
+   * Returns the direction ("next", "nextunique", "prev" or "prevunique") of the cursor.
+   */
+  readonly direction: IDBCursorDirection;
+  /**
+   * Returns the key of the cursor. Throws a "InvalidStateError" DOMException if the cursor is advancing or is finished.
+   */
+  readonly key: IDBValidKey;
+  /**
+   * Returns the effective key of the cursor. Throws a "InvalidStateError" DOMException if the cursor is advancing or is finished.
+   */
+  readonly primaryKey: IDBValidKey;
+  /**
+   * Returns the IDBObjectStore or IDBIndex the cursor was opened from.
+   */
+  readonly source: IDBObjectStore | IDBIndex;
+  /**
+   * Advances the cursor through the next count records in range.
+   */
+  advance(count: number): void;
+  /**
+   * Advances the cursor to the next record in range.
+   */
+  continue(key?: IDBValidKey): void;
+  /**
+   * Advances the cursor to the next record in range matching or after key and primaryKey. Throws an "InvalidAccessError" DOMException if the source is not an index.
+   */
+  continuePrimaryKey(key: IDBValidKey, primaryKey: IDBValidKey): void;
+  /**
+   * Delete the record pointed at by the cursor with a new value.
+   *
+   * If successful, request's result will be undefined.
+   */
+  delete(): IDBRequest<undefined>;
+  /**
+   * Updated the record pointed at by the cursor with a new value.
+   *
+   * Throws a "DataError" DOMException if the effective object store uses in-line keys and the key would have changed.
+   *
+   * If successful, request's result will be the record's key.
+   */
+  update(value: any): IDBRequest<IDBValidKey>;
+}
+
+/** This IndexedDB API interface represents a cursor for traversing or iterating over multiple records in a database. It is the same as the IDBCursor, except that it includes the value property. */
+export interface IDBCursorWithValue extends IDBCursor {
+  /**
+   * Returns the cursor's current value.
+   */
+  readonly value: any;
+}
+
+export interface IDBDatabaseEventMap {
+  abort: Event;
+  close: Event;
+  error: Event;
+  versionchange: IDBVersionChangeEvent;
+}
+
+/** This IndexedDB API interface provides a connection to a database; you can use an IDBDatabase object to open a transaction on your database then create, manipulate, and delete objects (data) in that database. The interface provides the only way to get and manage versions of the database. */
+export interface IDBDatabase extends EventTarget {
+  /**
+   * Returns the name of the database.
+   */
+  readonly name: string;
+  /**
+   * Returns a list of the names of object stores in the database.
+   */
+  readonly objectStoreNames: DOMStringList;
+  onabort: ((this: IDBDatabase, ev: Event) => any) | null;
+  onclose: ((this: IDBDatabase, ev: Event) => any) | null;
+  onerror: ((this: IDBDatabase, ev: Event) => any) | null;
+  onversionchange:
+    | ((this: IDBDatabase, ev: IDBVersionChangeEvent) => any)
+    | null;
+  /**
+   * Returns the version of the database.
+   */
+  readonly version: number;
+  /**
+   * Closes the connection once all running transactions have finished.
+   */
+  close(): void;
+  /**
+   * Creates a new object store with the given name and options and returns a new IDBObjectStore.
+   *
+   * Throws a "InvalidStateError" DOMException if not called within an upgrade transaction.
+   */
+  createObjectStore(
+    name: string,
+    optionalParameters?: IDBObjectStoreParameters,
+  ): IDBObjectStore;
+  /**
+   * Deletes the object store with the given name.
+   *
+   * Throws a "InvalidStateError" DOMException if not called within an upgrade transaction.
+   */
+  deleteObjectStore(name: string): void;
+  /**
+   * Returns a new transaction with the given mode ("readonly" or "readwrite") and scope which can be a single object store name or an array of names.
+   */
+  transaction(
+    storeNames: string | string[],
+    mode?: IDBTransactionMode,
+  ): IDBTransaction;
+  addEventListener<K extends keyof IDBDatabaseEventMap>(
+    type: K,
+    listener: (this: IDBDatabase, ev: IDBDatabaseEventMap[K]) => any,
+    options?: boolean | AddEventListenerOptions,
+  ): void;
+  addEventListener(
+    type: string,
+    listener: EventListenerOrEventListenerObject,
+    options?: boolean | AddEventListenerOptions,
+  ): void;
+  removeEventListener<K extends keyof IDBDatabaseEventMap>(
+    type: K,
+    listener: (this: IDBDatabase, ev: IDBDatabaseEventMap[K]) => any,
+    options?: boolean | EventListenerOptions,
+  ): void;
+  removeEventListener(
+    type: string,
+    listener: EventListenerOrEventListenerObject,
+    options?: boolean | EventListenerOptions,
+  ): void;
+}
+
+/** In the following code snippet, we make a request to open a database, and include handlers for the success and error cases. For a full working example, see our To-do Notifications app (view example live.) */
+export interface IDBFactory {
+  /**
+   * Compares two values as keys. Returns -1 if key1 precedes key2, 1 if key2 precedes key1, and 0 if the keys are equal.
+   *
+   * Throws a "DataError" DOMException if either input is not a valid key.
+   */
+  cmp(first: any, second: any): number;
+  /**
+   * Attempts to delete the named database. If the database already exists and there are open connections that don't close in response to a versionchange event, the request will be blocked until all they close. If the request is successful request's result will be null.
+   */
+  deleteDatabase(name: string): IDBOpenDBRequest;
+  /**
+   * Attempts to open a connection to the named database with the current version, or 1 if it does not already exist. If the request is successful request's result will be the connection.
+   */
+  open(name: string, version?: number): IDBOpenDBRequest;
+}
+
+/** IDBIndex interface of the IndexedDB API provides asynchronous access to an index in a database. An index is a kind of object store for looking up records in another object store, called the referenced object store. You use this interface to retrieve data. */
+export interface IDBIndex {
+  readonly keyPath: string | string[];
+  readonly multiEntry: boolean;
+  /**
+   * Returns the name of the index.
+   */
+  name: string;
+  /**
+   * Returns the IDBObjectStore the index belongs to.
+   */
+  readonly objectStore: IDBObjectStore;
+  readonly unique: boolean;
+  /**
+   * Retrieves the number of records matching the given key or key range in query.
+   *
+   * If successful, request's result will be the count.
+   */
+  count(key?: IDBValidKey | IDBKeyRange): IDBRequest<number>;
+  /**
+   * Retrieves the value of the first record matching the given key or key range in query.
+   *
+   * If successful, request's result will be the value, or undefined if there was no matching record.
+   */
+  get(key: IDBValidKey | IDBKeyRange): IDBRequest<any | undefined>;
+  /**
+   * Retrieves the values of the records matching the given key or key range in query (up to count if given).
+   *
+   * If successful, request's result will be an Array of the values.
+   */
+  getAll(
+    query?: IDBValidKey | IDBKeyRange | null,
+    count?: number,
+  ): IDBRequest<any[]>;
+  /**
+   * Retrieves the keys of records matching the given key or key range in query (up to count if given).
+   *
+   * If successful, request's result will be an Array of the keys.
+   */
+  getAllKeys(
+    query?: IDBValidKey | IDBKeyRange | null,
+    count?: number,
+  ): IDBRequest<IDBValidKey[]>;
+  /**
+   * Retrieves the key of the first record matching the given key or key range in query.
+   *
+   * If successful, request's result will be the key, or undefined if there was no matching record.
+   */
+  getKey(key: IDBValidKey | IDBKeyRange): IDBRequest<IDBValidKey | undefined>;
+  /**
+   * Opens a cursor over the records matching query, ordered by direction. If query is null, all records in index are matched.
+   *
+   * If successful, request's result will be an IDBCursorWithValue, or null if there were no matching records.
+   */
+  openCursor(
+    query?: IDBValidKey | IDBKeyRange | null,
+    direction?: IDBCursorDirection,
+  ): IDBRequest<IDBCursorWithValue | null>;
+  /**
+   * Opens a cursor with key only flag set over the records matching query, ordered by direction. If query is null, all records in index are matched.
+   *
+   * If successful, request's result will be an IDBCursor, or null if there were no matching records.
+   */
+  openKeyCursor(
+    query?: IDBValidKey | IDBKeyRange | null,
+    direction?: IDBCursorDirection,
+  ): IDBRequest<IDBCursor | null>;
+}
+
+/** A key range can be a single value or a range with upper and lower bounds or endpoints. If the key range has both upper and lower bounds, then it is bounded; if it has no bounds, it is unbounded. A bounded key range can either be open (the endpoints are excluded) or closed (the endpoints are included). To retrieve all keys within a certain range, you can use the following code constructs: */
+export interface IDBKeyRange {
+  /**
+   * Returns lower bound, or undefined if none.
+   */
+  readonly lower: any;
+  /**
+   * Returns true if the lower open flag is set, and false otherwise.
+   */
+  readonly lowerOpen: boolean;
+  /**
+   * Returns upper bound, or undefined if none.
+   */
+  readonly upper: any;
+  /**
+   * Returns true if the upper open flag is set, and false otherwise.
+   */
+  readonly upperOpen: boolean;
+  /**
+   * Returns true if key is included in the range, and false otherwise.
+   */
+  includes(key: any): boolean;
+}
+
+/** This example shows a variety of different uses of object stores, from updating the data structure with IDBObjectStore.createIndex inside an onupgradeneeded function, to adding a new item to our object store with IDBObjectStore.add. For a full working example, see our To-do Notifications app (view example live.) */
+export interface IDBObjectStore {
+  /**
+   * Returns true if the store has a key generator, and false otherwise.
+   */
+  readonly autoIncrement: boolean;
+  /**
+   * Returns a list of the names of indexes in the store.
+   */
+  readonly indexNames: DOMStringList;
+  /**
+   * Returns the key path of the store, or null if none.
+   */
+  readonly keyPath: string | string[];
+  /**
+   * Returns the name of the store.
+   */
+  name: string;
+  /**
+   * Returns the associated transaction.
+   */
+  readonly transaction: IDBTransaction;
+  /**
+   * Adds or updates a record in store with the given value and key.
+   *
+   * If the store uses in-line keys and key is specified a "DataError" DOMException will be thrown.
+   *
+   * If put() is used, any existing record with the key will be replaced. If add() is used, and if a record with the key already exists the request will fail, with request's error set to a "ConstraintError" DOMException.
+   *
+   * If successful, request's result will be the record's key.
+   */
+  add(value: any, key?: IDBValidKey): IDBRequest<IDBValidKey>;
+  /**
+   * Deletes all records in store.
+   *
+   * If successful, request's result will be undefined.
+   */
+  clear(): IDBRequest<undefined>;
+  /**
+   * Retrieves the number of records matching the given key or key range in query.
+   *
+   * If successful, request's result will be the count.
+   */
+  count(key?: IDBValidKey | IDBKeyRange): IDBRequest<number>;
+  /**
+   * Creates a new index in store with the given name, keyPath and options and returns a new IDBIndex. If the keyPath and options define constraints that cannot be satisfied with the data already in store the upgrade transaction will abort with a "ConstraintError" DOMException.
+   *
+   * Throws an "InvalidStateError" DOMException if not called within an upgrade transaction.
+   */
+  createIndex(
+    name: string,
+    keyPath: string | string[],
+    options?: IDBIndexParameters,
+  ): IDBIndex;
+  /**
+   * Deletes records in store with the given key or in the given key range in query.
+   *
+   * If successful, request's result will be undefined.
+   */
+  delete(key: IDBValidKey | IDBKeyRange): IDBRequest<undefined>;
+  /**
+   * Deletes the index in store with the given name.
+   *
+   * Throws an "InvalidStateError" DOMException if not called within an upgrade transaction.
+   */
+  deleteIndex(name: string): void;
+  /**
+   * Retrieves the value of the first record matching the given key or key range in query.
+   *
+   * If successful, request's result will be the value, or undefined if there was no matching record.
+   */
+  get(query: IDBValidKey | IDBKeyRange): IDBRequest<any | undefined>;
+  /**
+   * Retrieves the values of the records matching the given key or key range in query (up to count if given).
+   *
+   * If successful, request's result will be an Array of the values.
+   */
+  getAll(
+    query?: IDBValidKey | IDBKeyRange | null,
+    count?: number,
+  ): IDBRequest<any[]>;
+  /**
+   * Retrieves the keys of records matching the given key or key range in query (up to count if given).
+   *
+   * If successful, request's result will be an Array of the keys.
+   */
+  getAllKeys(
+    query?: IDBValidKey | IDBKeyRange | null,
+    count?: number,
+  ): IDBRequest<IDBValidKey[]>;
+  /**
+   * Retrieves the key of the first record matching the given key or key range in query.
+   *
+   * If successful, request's result will be the key, or undefined if there was no matching record.
+   */
+  getKey(query: IDBValidKey | IDBKeyRange): IDBRequest<IDBValidKey | undefined>;
+  index(name: string): IDBIndex;
+  /**
+   * Opens a cursor over the records matching query, ordered by direction. If query is null, all records in store are matched.
+   *
+   * If successful, request's result will be an IDBCursorWithValue pointing at the first matching record, or null if there were no matching records.
+   */
+  openCursor(
+    query?: IDBValidKey | IDBKeyRange | null,
+    direction?: IDBCursorDirection,
+  ): IDBRequest<IDBCursorWithValue | null>;
+  /**
+   * Opens a cursor with key only flag set over the records matching query, ordered by direction. If query is null, all records in store are matched.
+   *
+   * If successful, request's result will be an IDBCursor pointing at the first matching record, or null if there were no matching records.
+   */
+  openKeyCursor(
+    query?: IDBValidKey | IDBKeyRange | null,
+    direction?: IDBCursorDirection,
+  ): IDBRequest<IDBCursor | null>;
+  /**
+   * Adds or updates a record in store with the given value and key.
+   *
+   * If the store uses in-line keys and key is specified a "DataError" DOMException will be thrown.
+   *
+   * If put() is used, any existing record with the key will be replaced. If add() is used, and if a record with the key already exists the request will fail, with request's error set to a "ConstraintError" DOMException.
+   *
+   * If successful, request's result will be the record's key.
+   */
+  put(value: any, key?: IDBValidKey): IDBRequest<IDBValidKey>;
+}
+
+export interface IDBOpenDBRequestEventMap extends IDBRequestEventMap {
+  blocked: Event;
+  upgradeneeded: IDBVersionChangeEvent;
+}
+
+/** Also inherits methods from its parents IDBRequest and EventTarget. */
+export interface IDBOpenDBRequest extends IDBRequest<IDBDatabase> {
+  onblocked: ((this: IDBOpenDBRequest, ev: Event) => any) | null;
+  onupgradeneeded:
+    | ((this: IDBOpenDBRequest, ev: IDBVersionChangeEvent) => any)
+    | null;
+  addEventListener<K extends keyof IDBOpenDBRequestEventMap>(
+    type: K,
+    listener: (this: IDBOpenDBRequest, ev: IDBOpenDBRequestEventMap[K]) => any,
+    options?: boolean | AddEventListenerOptions,
+  ): void;
+  addEventListener(
+    type: string,
+    listener: EventListenerOrEventListenerObject,
+    options?: boolean | AddEventListenerOptions,
+  ): void;
+  removeEventListener<K extends keyof IDBOpenDBRequestEventMap>(
+    type: K,
+    listener: (this: IDBOpenDBRequest, ev: IDBOpenDBRequestEventMap[K]) => any,
+    options?: boolean | EventListenerOptions,
+  ): void;
+  removeEventListener(
+    type: string,
+    listener: EventListenerOrEventListenerObject,
+    options?: boolean | EventListenerOptions,
+  ): void;
+}
+
+export type IDBRequestReadyState = "done" | "pending";
+
+export interface IDBRequestEventMap {
+  error: Event;
+  success: Event;
+}
+
+/** An abnormal event (called an exception) which occurs as a result of calling a method or accessing a property of a web API. */
+export interface DOMException {
+  readonly code: number;
+  readonly message: string;
+  readonly name: string;
+  readonly ABORT_ERR: number;
+  readonly DATA_CLONE_ERR: number;
+  readonly DOMSTRING_SIZE_ERR: number;
+  readonly HIERARCHY_REQUEST_ERR: number;
+  readonly INDEX_SIZE_ERR: number;
+  readonly INUSE_ATTRIBUTE_ERR: number;
+  readonly INVALID_ACCESS_ERR: number;
+  readonly INVALID_CHARACTER_ERR: number;
+  readonly INVALID_MODIFICATION_ERR: number;
+  readonly INVALID_NODE_TYPE_ERR: number;
+  readonly INVALID_STATE_ERR: number;
+  readonly NAMESPACE_ERR: number;
+  readonly NETWORK_ERR: number;
+  readonly NOT_FOUND_ERR: number;
+  readonly NOT_SUPPORTED_ERR: number;
+  readonly NO_DATA_ALLOWED_ERR: number;
+  readonly NO_MODIFICATION_ALLOWED_ERR: number;
+  readonly QUOTA_EXCEEDED_ERR: number;
+  readonly SECURITY_ERR: number;
+  readonly SYNTAX_ERR: number;
+  readonly TIMEOUT_ERR: number;
+  readonly TYPE_MISMATCH_ERR: number;
+  readonly URL_MISMATCH_ERR: number;
+  readonly VALIDATION_ERR: number;
+  readonly WRONG_DOCUMENT_ERR: number;
+}
+
+/** The request object does not initially contain any information about the result of the operation, but once information becomes available, an event is fired on the request, and the information becomes available through the properties of the IDBRequest instance. */
+export interface IDBRequest<T = any> extends EventTarget {
+  /**
+   * When a request is completed, returns the error (a DOMException), or null if the request succeeded. Throws a "InvalidStateError" DOMException if the request is still pending.
+   */
+  readonly error: DOMException | null;
+  onerror: ((this: IDBRequest<T>, ev: Event) => any) | null;
+  onsuccess: ((this: IDBRequest<T>, ev: Event) => any) | null;
+  /**
+   * Returns "pending" until a request is complete, then returns "done".
+   */
+  readonly readyState: IDBRequestReadyState;
+  /**
+   * When a request is completed, returns the result, or undefined if the request failed. Throws a "InvalidStateError" DOMException if the request is still pending.
+   */
+  readonly result: T;
+  /**
+   * Returns the IDBObjectStore, IDBIndex, or IDBCursor the request was made against, or null if is was an open request.
+   */
+  readonly source: IDBObjectStore | IDBIndex | IDBCursor;
+  /**
+   * Returns the IDBTransaction the request was made within. If this as an open request, then it returns an upgrade transaction while it is running, or null otherwise.
+   */
+  readonly transaction: IDBTransaction | null;
+  addEventListener<K extends keyof IDBRequestEventMap>(
+    type: K,
+    listener: (this: IDBRequest<T>, ev: IDBRequestEventMap[K]) => any,
+    options?: boolean | AddEventListenerOptions,
+  ): void;
+  addEventListener(
+    type: string,
+    listener: EventListenerOrEventListenerObject,
+    options?: boolean | AddEventListenerOptions,
+  ): void;
+  removeEventListener<K extends keyof IDBRequestEventMap>(
+    type: K,
+    listener: (this: IDBRequest<T>, ev: IDBRequestEventMap[K]) => any,
+    options?: boolean | EventListenerOptions,
+  ): void;
+  removeEventListener(
+    type: string,
+    listener: EventListenerOrEventListenerObject,
+    options?: boolean | EventListenerOptions,
+  ): void;
+}
+
+export interface IDBTransactionEventMap {
+  abort: Event;
+  complete: Event;
+  error: Event;
+}
+
+export interface IDBTransaction extends EventTarget {
+  /**
+   * Returns the transaction's connection.
+   */
+  readonly db: IDBDatabase;
+  /**
+   * If the transaction was aborted, returns the error (a DOMException) providing the reason.
+   */
+  readonly error: DOMException;
+  /**
+   * Returns the mode the transaction was created with ("readonly" or "readwrite"), or "versionchange" for an upgrade transaction.
+   */
+  readonly mode: IDBTransactionMode;
+  /**
+   * Returns a list of the names of object stores in the transaction's scope. For an upgrade transaction this is all object stores in the database.
+   */
+  readonly objectStoreNames: DOMStringList;
+  onabort: ((this: IDBTransaction, ev: Event) => any) | null;
+  oncomplete: ((this: IDBTransaction, ev: Event) => any) | null;
+  onerror: ((this: IDBTransaction, ev: Event) => any) | null;
+  /**
+   * Aborts the transaction. All pending requests will fail with a "AbortError" DOMException and all changes made to the database will be reverted.
+   */
+  abort(): void;
+  /**
+   * Returns an IDBObjectStore in the transaction's scope.
+   */
+  objectStore(name: string): IDBObjectStore;
+  addEventListener<K extends keyof IDBTransactionEventMap>(
+    type: K,
+    listener: (this: IDBTransaction, ev: IDBTransactionEventMap[K]) => any,
+    options?: boolean | AddEventListenerOptions,
+  ): void;
+  addEventListener(
+    type: string,
+    listener: EventListenerOrEventListenerObject,
+    options?: boolean | AddEventListenerOptions,
+  ): void;
+  removeEventListener<K extends keyof IDBTransactionEventMap>(
+    type: K,
+    listener: (this: IDBTransaction, ev: IDBTransactionEventMap[K]) => any,
+    options?: boolean | EventListenerOptions,
+  ): void;
+  removeEventListener(
+    type: string,
+    listener: EventListenerOrEventListenerObject,
+    options?: boolean | EventListenerOptions,
+  ): void;
+}
+
+/** This IndexedDB API interface indicates that the version of the database has changed, as the result of an IDBOpenDBRequest.onupgradeneeded event handler function. */
+export interface IDBVersionChangeEvent extends Event {
+  readonly newVersion: number | null;
+  readonly oldVersion: number;
+}
diff --git a/packages/idb-bridge/src/index.ts b/packages/idb-bridge/src/index.ts
index a65458748..8f19c9a31 100644
--- a/packages/idb-bridge/src/index.ts
+++ b/packages/idb-bridge/src/index.ts
@@ -1,23 +1,23 @@
 import { BridgeIDBFactory } from "./BridgeIDBFactory";
 import { BridgeIDBCursor } from "./BridgeIDBCursor";
 import { BridgeIDBIndex } from "./BridgeIDBIndex";
-import BridgeIDBDatabase from "./BridgeIDBDatabase";
-import BridgeIDBKeyRange from "./BridgeIDBKeyRange";
-import BridgeIDBObjectStore from "./BridgeIDBObjectStore";
-import BridgeIDBOpenDBRequest from "./BridgeIDBOpenDBRequest";
-import BridgeIDBRequest from "./BridgeIDBRequest";
-import BridgeIDBTransaction from "./BridgeIDBTransaction";
-import BridgeIDBVersionChangeEvent from "./BridgeIDBVersionChangeEvent";
+import { BridgeIDBDatabase } from "./BridgeIDBDatabase";
+import { BridgeIDBKeyRange } from "./BridgeIDBKeyRange";
+import { BridgeIDBObjectStore } from "./BridgeIDBObjectStore";
+import { BridgeIDBOpenDBRequest } from "./BridgeIDBOpenDBRequest";
+import { BridgeIDBRequest } from "./BridgeIDBRequest";
+import { BridgeIDBTransaction } from "./BridgeIDBTransaction";
+import { BridgeIDBVersionChangeEvent } from "./BridgeIDBVersionChangeEvent";
 
 export { BridgeIDBFactory, BridgeIDBCursor };
 
 export { MemoryBackend } from "./MemoryBackend";
 
 // globalThis polyfill, see https://mathiasbynens.be/notes/globalthis
-(function() {
+(function () {
   if (typeof globalThis === "object") return;
   Object.defineProperty(Object.prototype, "__magic__", {
-    get: function() {
+    get: function () {
       return this;
     },
     configurable: true, // This makes it possible to `delete` the getter later.
@@ -58,3 +58,6 @@ export function shimIndexedDB(factory: BridgeIDBFactory): void {
   // @ts-ignore: shimming
   globalThis.IDBVersionChangeEvent = BridgeIDBVersionChangeEvent;
 }
+
+import * as idbtypes from "./idbtypes";
+export type { idbtypes };
diff --git a/packages/idb-bridge/src/tree/b+tree.ts b/packages/idb-bridge/src/tree/b+tree.ts
index 783c6b049..59a49baa3 100644
--- a/packages/idb-bridge/src/tree/b+tree.ts
+++ b/packages/idb-bridge/src/tree/b+tree.ts
@@ -24,14 +24,29 @@ SPDX-License-Identifier: MIT
 
 // Original repository: https://github.com/qwertie/btree-typescript
 
-
-import { ISortedMap, ISortedMapF } from './interfaces';
+import { ISortedMap, ISortedMapF } from "./interfaces";
 export {
-  ISetSource, ISetSink, ISet, ISetF, ISortedSetSource, ISortedSet, ISortedSetF,
-  IMapSource, IMapSink, IMap, IMapF, ISortedMapSource, ISortedMap, ISortedMapF
-} from './interfaces';
-
-export type EditRangeResult<V,R=number> = {value?:V, break?:R, delete?:boolean};
+  ISetSource,
+  ISetSink,
+  ISet,
+  ISetF,
+  ISortedSetSource,
+  ISortedSet,
+  ISortedSetF,
+  IMapSource,
+  IMapSink,
+  IMap,
+  IMapF,
+  ISortedMapSource,
+  ISortedMap,
+  ISortedMapF,
+} from "./interfaces";
+
+export type EditRangeResult<V, R = number> = {
+  value?: V;
+  break?: R;
+  delete?: boolean;
+};
 
 type index = number;
 
@@ -57,7 +72,7 @@ type index = number;
 //   - V8 source (NewElementsCapacity in src/objects.h): arrays grow by 50% + 16 elements
 
 /** Compares two numbers, strings, arrays of numbers/strings, Dates,
- *  or objects that have a valueOf() method returning a number or string. 
+ *  or objects that have a valueOf() method returning a number or string.
  *  Optimized for numbers. Returns 1 if a>b, -1 if a<b, and 0 if a===b.
  */
 export function defaultComparator(a: any, b: any) {
@@ -66,42 +81,42 @@ export function defaultComparator(a: any, b: any) {
   // General case (c is NaN): string / arrays / Date / incomparable things
   if (a) a = a.valueOf();
   if (b) b = b.valueOf();
-  return a < b ? -1 : a > b ? 1 : a == b ? 0 : c;   
-};
+  return a < b ? -1 : a > b ? 1 : a == b ? 0 : c;
+}
 
 /**
- * A reasonably fast collection of key-value pairs with a powerful API. 
+ * A reasonably fast collection of key-value pairs with a powerful API.
  * Largely compatible with the standard Map. BTree is a B+ tree data structure,
  * so the collection is sorted by key.
- * 
+ *
  * B+ trees tend to use memory more efficiently than hashtables such as the
- * standard Map, especially when the collection contains a large number of 
- * items. However, maintaining the sort order makes them modestly slower: 
+ * standard Map, especially when the collection contains a large number of
+ * items. However, maintaining the sort order makes them modestly slower:
  * O(log size) rather than O(1). This B+ tree implementation supports O(1)
  * fast cloning. It also supports freeze(), which can be used to ensure that
  * a BTree is not changed accidentally.
- * 
+ *
  * Confusingly, the ES6 Map.forEach(c) method calls c(value,key) instead of
  * c(key,value), in contrast to other methods such as set() and entries()
- * which put the key first. I can only assume that the order was reversed on 
+ * which put the key first. I can only assume that the order was reversed on
  * the theory that users would usually want to examine values and ignore keys.
- * BTree's forEach() therefore works the same way, but a second method 
+ * BTree's forEach() therefore works the same way, but a second method
  * `.forEachPair((key,value)=>{...})` is provided which sends you the key
- * first and the value second; this method is slightly faster because it is 
+ * first and the value second; this method is slightly faster because it is
  * the "native" for-each method for this class.
- * 
- * Out of the box, BTree supports keys that are numbers, strings, arrays of 
- * numbers/strings, Date, and objects that have a valueOf() method returning a 
+ *
+ * Out of the box, BTree supports keys that are numbers, strings, arrays of
+ * numbers/strings, Date, and objects that have a valueOf() method returning a
  * number or string. Other data types, such as arrays of Date or custom
- * objects, require a custom comparator, which you must pass as the second 
- * argument to the constructor (the first argument is an optional list of 
+ * objects, require a custom comparator, which you must pass as the second
+ * argument to the constructor (the first argument is an optional list of
  * initial items). Symbols cannot be used as keys because they are unordered
  * (one Symbol is never "greater" or "less" than another).
- * 
+ *
  * @example
  * Given a {name: string, age: number} object, you can create a tree sorted by
  * name and then by age like this:
- *   
+ *
  *     var tree = new BTree(undefined, (a, b) => {
  *       if (a.name > b.name)
  *         return 1; // Return a number >0 when a > b
@@ -110,36 +125,36 @@ export function defaultComparator(a: any, b: any) {
  *       else // names are equal (or incomparable)
  *         return a.age - b.age; // Return >0 when a.age > b.age
  *     });
- * 
+ *
  *     tree.set({name:"Bill", age:17}, "happy");
  *     tree.set({name:"Fran", age:40}, "busy & stressed");
  *     tree.set({name:"Bill", age:55}, "recently laid off");
  *     tree.forEachPair((k, v) => {
  *       console.log(`Name: ${k.name} Age: ${k.age} Status: ${v}`);
  *     });
- * 
+ *
  * @description
  * The "range" methods (`forEach, forRange, editRange`) will return the number
  * of elements that were scanned. In addition, the callback can return {break:R}
  * to stop early and return R from the outer function.
- * 
+ *
  * - TODO: Test performance of preallocating values array at max size
  * - TODO: Add fast initialization when a sorted array is provided to constructor
- * 
+ *
  * For more documentation see https://github.com/qwertie/btree-typescript
  *
- * Are you a C# developer? You might like the similar data structures I made for C#: 
+ * Are you a C# developer? You might like the similar data structures I made for C#:
  * BDictionary, BList, etc. See http://core.loyc.net/collections/
- * 
+ *
  * @author David Piepgrass
  */
-export default class BTree<K=any, V=any> implements ISortedMapF<K,V>, ISortedMap<K,V>
-{
-  private _root: BNode<K, V> = EmptyLeaf as BNode<K,V>;
+export default class BTree<K = any, V = any>
+  implements ISortedMapF<K, V>, ISortedMap<K, V> {
+  private _root: BNode<K, V> = EmptyLeaf as BNode<K, V>;
   _size: number = 0;
   _maxNodeSize: number;
-  _compare: (a:K, b:K) => number;
-  
+  _compare: (a: K, b: K) => number;
+
   /**
    * Initializes an empty B+ tree.
    * @param compare Custom function to compare pairs of elements in the tree.
@@ -148,60 +163,78 @@ export default class BTree<K=any, V=any> implements ISortedMapF<K,V>, ISortedMap
    * @param maxNodeSize Branching factor (maximum items or children per node)
    *   Must be in range 4..256. If undefined or <4 then default is used; if >256 then 256.
    */
-  public constructor(entries?: [K,V][], compare?: (a: K, b: K) => number, maxNodeSize?: number) {
+  public constructor(
+    entries?: [K, V][],
+    compare?: (a: K, b: K) => number,
+    maxNodeSize?: number,
+  ) {
     this._maxNodeSize = maxNodeSize! >= 4 ? Math.min(maxNodeSize!, 256) : 32;
     this._compare = compare || defaultComparator;
-    if (entries)
-      this.setPairs(entries);
+    if (entries) this.setPairs(entries);
   }
-  
+
   // ES6 Map<K,V> methods ///////////////////////////////////////////////////
 
   /** Gets the number of key-value pairs in the tree. */
-  get size() { return this._size; }
+  get size() {
+    return this._size;
+  }
   /** Gets the number of key-value pairs in the tree. */
-  get length() { return this._size; }
+  get length() {
+    return this._size;
+  }
   /** Returns true iff the tree contains no key-value pairs. */
-  get isEmpty() { return this._size === 0; }
+  get isEmpty() {
+    return this._size === 0;
+  }
 
   /** Releases the tree so that its size is 0. */
   clear() {
-    this._root = EmptyLeaf as BNode<K,V>;
+    this._root = EmptyLeaf as BNode<K, V>;
     this._size = 0;
   }
 
-  forEach(callback: (v:V, k:K, tree:BTree<K,V>) => void, thisArg?: any): number;
+  forEach(
+    callback: (v: V, k: K, tree: BTree<K, V>) => void,
+    thisArg?: any,
+  ): number;
 
-  /** Runs a function for each key-value pair, in order from smallest to 
+  /** Runs a function for each key-value pair, in order from smallest to
    *  largest key. For compatibility with ES6 Map, the argument order to
-   *  the callback is backwards: value first, then key. Call forEachPair 
+   *  the callback is backwards: value first, then key. Call forEachPair
    *  instead to receive the key as the first argument.
    * @param thisArg If provided, this parameter is assigned as the `this`
    *        value for each callback.
    * @returns the number of values that were sent to the callback,
    *        or the R value if the callback returned {break:R}. */
-  forEach<R=number>(callback: (v:V, k:K, tree:BTree<K,V>) => {break?:R}|void, thisArg?: any): R|number {
-    if (thisArg !== undefined)
-      callback = callback.bind(thisArg);
+  forEach<R = number>(
+    callback: (v: V, k: K, tree: BTree<K, V>) => { break?: R } | void,
+    thisArg?: any,
+  ): R | number {
+    if (thisArg !== undefined) callback = callback.bind(thisArg);
     return this.forEachPair((k, v) => callback(v, k, this));
   }
 
-  /** Runs a function for each key-value pair, in order from smallest to 
+  /** Runs a function for each key-value pair, in order from smallest to
    *  largest key. The callback can return {break:R} (where R is any value
    *  except undefined) to stop immediately and return R from forEachPair.
-   * @param onFound A function that is called for each key-value pair. This 
+   * @param onFound A function that is called for each key-value pair. This
    *        function can return {break:R} to stop early with result R.
-   *        The reason that you must return {break:R} instead of simply R 
-   *        itself is for consistency with editRange(), which allows 
+   *        The reason that you must return {break:R} instead of simply R
+   *        itself is for consistency with editRange(), which allows
    *        multiple actions, not just breaking.
-   * @param initialCounter This is the value of the third argument of 
-   *        `onFound` the first time it is called. The counter increases 
+   * @param initialCounter This is the value of the third argument of
+   *        `onFound` the first time it is called. The counter increases
    *        by one each time `onFound` is called. Default value: 0
    * @returns the number of pairs sent to the callback (plus initialCounter,
    *        if you provided one). If the callback returned {break:R} then
    *        the R value is returned instead. */
-  forEachPair<R=number>(callback: (k:K, v:V, counter:number) => {break?:R}|void, initialCounter?: number): R|number {
-    var low = this.minKey(), high = this.maxKey();
+  forEachPair<R = number>(
+    callback: (k: K, v: V, counter: number) => { break?: R } | void,
+    initialCounter?: number,
+  ): R | number {
+    var low = this.minKey(),
+      high = this.maxKey();
     return this.forRange(low!, high!, true, callback, initialCounter);
   }
 
@@ -214,13 +247,13 @@ export default class BTree<K=any, V=any> implements ISortedMapF<K,V>, ISortedMap
   get(key: K, defaultValue?: V): V | undefined {
     return this._root.get(key, defaultValue, this);
   }
-  
+
   /**
    * Adds or overwrites a key-value pair in the B+ tree.
    * @param key the key is used to determine the sort order of
    *        data in the tree.
    * @param value data to associate with the key (optional)
-   * @param overwrite Whether to overwrite an existing key-value pair 
+   * @param overwrite Whether to overwrite an existing key-value pair
    *        (default: true). If this is false and there is an existing
    *        key-value pair then this method has no effect.
    * @returns true if a new key-value pair was added.
@@ -229,14 +262,12 @@ export default class BTree<K=any, V=any> implements ISortedMapF<K,V>, ISortedMap
    * as well as the value. This has no effect unless the new key
    * has data that does not affect its sort order.
    */
-  set(key: K, value: V, overwrite?: boolean): boolean { 
-    if (this._root.isShared)
-      this._root = this._root.clone();
+  set(key: K, value: V, overwrite?: boolean): boolean {
+    if (this._root.isShared) this._root = this._root.clone();
     var result = this._root.set(key, value, overwrite, this);
-    if (result === true || result === false)
-      return result;
+    if (result === true || result === false) return result;
     // Root node has split, so create a new root node.
-    this._root = new BNodeInternal<K,V>([this._root, result]);
+    this._root = new BNodeInternal<K, V>([this._root, result]);
     return true;
   }
 
@@ -247,7 +278,7 @@ export default class BTree<K=any, V=any> implements ISortedMapF<K,V>, ISortedMap
    * @param key Key to detect
    * @description Computational complexity: O(log size)
    */
-  has(key: K): boolean { 
+  has(key: K): boolean {
     return this.forRange(key, key, true, undefined) !== 0;
   }
 
@@ -264,42 +295,50 @@ export default class BTree<K=any, V=any> implements ISortedMapF<K,V>, ISortedMap
   // Clone-mutators /////////////////////////////////////////////////////////
 
   /** Returns a copy of the tree with the specified key set (the value is undefined). */
-  with(key: K): BTree<K,V|undefined>;
+  with(key: K): BTree<K, V | undefined>;
   /** Returns a copy of the tree with the specified key-value pair set. */
-  with<V2>(key: K, value: V2, overwrite?: boolean): BTree<K,V|V2>;
-  with<V2>(key: K, value?: V2, overwrite?: boolean): BTree<K,V|V2|undefined> {
-    let nu = this.clone() as BTree<K,V|V2|undefined>;
+  with<V2>(key: K, value: V2, overwrite?: boolean): BTree<K, V | V2>;
+  with<V2>(
+    key: K,
+    value?: V2,
+    overwrite?: boolean,
+  ): BTree<K, V | V2 | undefined> {
+    let nu = this.clone() as BTree<K, V | V2 | undefined>;
     return nu.set(key, value, overwrite) || overwrite ? nu : this;
   }
 
   /** Returns a copy of the tree with the specified key-value pairs set. */
-  withPairs<V2>(pairs: [K,V|V2][], overwrite: boolean): BTree<K,V|V2> {
-    let nu = this.clone() as BTree<K,V|V2>;
+  withPairs<V2>(pairs: [K, V | V2][], overwrite: boolean): BTree<K, V | V2> {
+    let nu = this.clone() as BTree<K, V | V2>;
     return nu.setPairs(pairs, overwrite) !== 0 || overwrite ? nu : this;
   }
 
-  /** Returns a copy of the tree with the specified keys present. 
+  /** Returns a copy of the tree with the specified keys present.
    *  @param keys The keys to add. If a key is already present in the tree,
    *         neither the existing key nor the existing value is modified.
-   *  @param returnThisIfUnchanged if true, returns this if all keys already 
+   *  @param returnThisIfUnchanged if true, returns this if all keys already
    *  existed. Performance note: due to the architecture of this class, all
    *  node(s) leading to existing keys are cloned even if the collection is
    *  ultimately unchanged.
-  */
-  withKeys(keys: K[], returnThisIfUnchanged?: boolean): BTree<K,V|undefined> {
-    let nu = this.clone() as BTree<K,V|undefined>, changed = false;
+   */
+  withKeys(
+    keys: K[],
+    returnThisIfUnchanged?: boolean,
+  ): BTree<K, V | undefined> {
+    let nu = this.clone() as BTree<K, V | undefined>,
+      changed = false;
     for (var i = 0; i < keys.length; i++)
       changed = nu.set(keys[i], undefined, false) || changed;
     return returnThisIfUnchanged && !changed ? this : nu;
   }
 
-  /** Returns a copy of the tree with the specified key removed. 
+  /** Returns a copy of the tree with the specified key removed.
    * @param returnThisIfUnchanged if true, returns this if the key didn't exist.
    *  Performance note: due to the architecture of this class, node(s) leading
    *  to where the key would have been stored are cloned even when the key
    *  turns out not to exist and the collection is unchanged.
    */
-  without(key: K, returnThisIfUnchanged?: boolean): BTree<K,V> {
+  without(key: K, returnThisIfUnchanged?: boolean): BTree<K, V> {
     return this.withoutRange(key, key, true, returnThisIfUnchanged);
   }
 
@@ -309,61 +348,92 @@ export default class BTree<K=any, V=any> implements ISortedMapF<K,V>, ISortedMap
    *  node(s) leading to where the key would have been stored are cloned
    *  even when the key turns out not to exist.
    */
-  withoutKeys(keys: K[], returnThisIfUnchanged?: boolean): BTree<K,V> {
+  withoutKeys(keys: K[], returnThisIfUnchanged?: boolean): BTree<K, V> {
     let nu = this.clone();
     return nu.deleteKeys(keys) || !returnThisIfUnchanged ? nu : this;
   }
 
   /** Returns a copy of the tree with the specified range of keys removed. */
-  withoutRange(low: K, high: K, includeHigh: boolean, returnThisIfUnchanged?: boolean): BTree<K,V> {
+  withoutRange(
+    low: K,
+    high: K,
+    includeHigh: boolean,
+    returnThisIfUnchanged?: boolean,
+  ): BTree<K, V> {
     let nu = this.clone();
     if (nu.deleteRange(low, high, includeHigh) === 0 && returnThisIfUnchanged)
       return this;
     return nu;
   }
 
-  /** Returns a copy of the tree with pairs removed whenever the callback 
+  /** Returns a copy of the tree with pairs removed whenever the callback
    *  function returns false. `where()` is a synonym for this method. */
-  filter(callback: (k:K,v:V,counter:number) => boolean, returnThisIfUnchanged?: boolean): BTree<K,V> {
+  filter(
+    callback: (k: K, v: V, counter: number) => boolean,
+    returnThisIfUnchanged?: boolean,
+  ): BTree<K, V> {
     var nu = this.greedyClone();
     var del: any;
-    nu.editAll((k,v,i) => {
-      if (!callback(k, v, i)) return del = Delete;
+    nu.editAll((k, v, i) => {
+      if (!callback(k, v, i)) return (del = Delete);
     });
-    if (!del && returnThisIfUnchanged)
-      return this;
+    if (!del && returnThisIfUnchanged) return this;
     return nu;
   }
 
   /** Returns a copy of the tree with all values altered by a callback function. */
-  mapValues<R>(callback: (v:V,k:K,counter:number) => R): BTree<K,R> {
-    var tmp = {} as {value:R};
+  mapValues<R>(callback: (v: V, k: K, counter: number) => R): BTree<K, R> {
+    var tmp = {} as { value: R };
     var nu = this.greedyClone();
-    nu.editAll((k,v,i) => {
-      return tmp.value = callback(v, k, i), tmp as any;
+    nu.editAll((k, v, i) => {
+      return (tmp.value = callback(v, k, i)), tmp as any;
     });
-    return nu as any as BTree<K,R>;
+    return (nu as any) as BTree<K, R>;
   }
 
-  /** Performs a reduce operation like the `reduce` method of `Array`. 
-   *  It is used to combine all pairs into a single value, or perform 
+  /** Performs a reduce operation like the `reduce` method of `Array`.
+   *  It is used to combine all pairs into a single value, or perform
    *  conversions. `reduce` is best understood by example. For example,
-   *  `tree.reduce((P, pair) => P * pair[0], 1)` multiplies all keys 
-   *  together. It means "start with P=1, and for each pair multiply 
-   *  it by the key in pair[0]". Another example would be converting 
+   *  `tree.reduce((P, pair) => P * pair[0], 1)` multiplies all keys
+   *  together. It means "start with P=1, and for each pair multiply
+   *  it by the key in pair[0]". Another example would be converting
    *  the tree to a Map (in this example, note that M.set returns M):
-   *  
+   *
    *  var M = tree.reduce((M, pair) => M.set(pair[0],pair[1]), new Map())
-   *  
+   *
    *  **Note**: the same array is sent to the callback on every iteration.
    */
-  reduce<R>(callback: (previous:R,currentPair:[K,V],counter:number,tree:BTree<K,V>) => R, initialValue: R): R;
-  reduce<R>(callback: (previous:R|undefined,currentPair:[K,V],counter:number,tree:BTree<K,V>) => R): R|undefined;
-  reduce<R>(callback: (previous:R|undefined,currentPair:[K,V],counter:number,tree:BTree<K,V>) => R, initialValue?: R): R|undefined {
-    let i = 0, p = initialValue;
-    var it = this.entries(this.minKey(), ReusedArray), next;
-    while (!(next = it.next()).done)
-      p = callback(p, next.value, i++, this);
+  reduce<R>(
+    callback: (
+      previous: R,
+      currentPair: [K, V],
+      counter: number,
+      tree: BTree<K, V>,
+    ) => R,
+    initialValue: R,
+  ): R;
+  reduce<R>(
+    callback: (
+      previous: R | undefined,
+      currentPair: [K, V],
+      counter: number,
+      tree: BTree<K, V>,
+    ) => R,
+  ): R | undefined;
+  reduce<R>(
+    callback: (
+      previous: R | undefined,
+      currentPair: [K, V],
+      counter: number,
+      tree: BTree<K, V>,
+    ) => R,
+    initialValue?: R,
+  ): R | undefined {
+    let i = 0,
+      p = initialValue;
+    var it = this.entries(this.minKey(), ReusedArray),
+      next;
+    while (!(next = it.next()).done) p = callback(p, next.value, i++, this);
     return p;
   }
 
@@ -377,53 +447,59 @@ export default class BTree<K=any, V=any> implements ISortedMapF<K,V>, ISortedMap
    *  @param reusedArray Optional array used repeatedly to store key-value
    *         pairs, to avoid creating a new array on every iteration.
    */
-  entries(lowestKey?: K, reusedArray?: (K|V)[]): IterableIterator<[K,V]> {
+  entries(lowestKey?: K, reusedArray?: (K | V)[]): IterableIterator<[K, V]> {
     var info = this.findPath(lowestKey);
-    if (info === undefined) return iterator<[K,V]>();
-    var {nodequeue, nodeindex, leaf} = info;
+    if (info === undefined) return iterator<[K, V]>();
+    var { nodequeue, nodeindex, leaf } = info;
     var state = reusedArray !== undefined ? 1 : 0;
-    var i = (lowestKey === undefined ? -1 : leaf.indexOf(lowestKey, 0, this._compare) - 1);
+    var i =
+      lowestKey === undefined
+        ? -1
+        : leaf.indexOf(lowestKey, 0, this._compare) - 1;
 
-    return iterator<[K,V]>(() => {
+    return iterator<[K, V]>(() => {
       jump: for (;;) {
-        switch(state) {
+        switch (state) {
           case 0:
             if (++i < leaf.keys.length)
-              return {done: false, value: [leaf.keys[i], leaf.values[i]]};
+              return { done: false, value: [leaf.keys[i], leaf.values[i]] };
             state = 2;
             continue;
           case 1:
             if (++i < leaf.keys.length) {
-              reusedArray![0] = leaf.keys[i], reusedArray![1] = leaf.values[i];
-              return {done: false, value: reusedArray as [K,V]};
+              (reusedArray![0] = leaf.keys[i]),
+                (reusedArray![1] = leaf.values[i]);
+              return { done: false, value: reusedArray as [K, V] };
             }
             state = 2;
           case 2:
             // Advance to the next leaf node
-            for (var level = -1;;) {
+            for (var level = -1; ; ) {
               if (++level >= nodequeue.length) {
-                state = 3; continue jump;
+                state = 3;
+                continue jump;
               }
-              if (++nodeindex[level] < nodequeue[level].length)
-                break;
+              if (++nodeindex[level] < nodequeue[level].length) break;
             }
             for (; level > 0; level--) {
-              nodequeue[level-1] = (nodequeue[level][nodeindex[level]] as BNodeInternal<K,V>).children;
-              nodeindex[level-1] = 0;
+              nodequeue[level - 1] = (nodequeue[level][
+                nodeindex[level]
+              ] as BNodeInternal<K, V>).children;
+              nodeindex[level - 1] = 0;
             }
             leaf = nodequeue[0][nodeindex[0]];
             i = -1;
             state = reusedArray !== undefined ? 1 : 0;
             continue;
           case 3:
-            return {done: true, value: undefined};
+            return { done: true, value: undefined };
         }
       }
     });
   }
 
   /** Returns an iterator that provides items in reversed order.
-   *  @param highestKey Key at which to start iterating, or undefined to 
+   *  @param highestKey Key at which to start iterating, or undefined to
    *         start at minKey(). If the specified key doesn't exist then iteration
    *         starts at the next lower key (according to the comparator).
    *  @param reusedArray Optional array used repeatedly to store key-value
@@ -431,49 +507,56 @@ export default class BTree<K=any, V=any> implements ISortedMapF<K,V>, ISortedMap
    *  @param skipHighest Iff this flag is true and the highestKey exists in the
    *         collection, the pair matching highestKey is skipped, not iterated.
    */
-  entriesReversed(highestKey?: K, reusedArray?: (K|V)[], skipHighest?: boolean): IterableIterator<[K,V]> {
+  entriesReversed(
+    highestKey?: K,
+    reusedArray?: (K | V)[],
+    skipHighest?: boolean,
+  ): IterableIterator<[K, V]> {
     if ((highestKey = highestKey || this.maxKey()) === undefined)
-      return iterator<[K,V]>(); // collection is empty
-    var {nodequeue,nodeindex,leaf} = this.findPath(highestKey) || this.findPath(this.maxKey())!;
+      return iterator<[K, V]>(); // collection is empty
+    var { nodequeue, nodeindex, leaf } =
+      this.findPath(highestKey) || this.findPath(this.maxKey())!;
     check(!nodequeue[0] || leaf === nodequeue[0][nodeindex[0]], "wat!");
     var i = leaf.indexOf(highestKey, 0, this._compare);
-    if (!(skipHighest || this._compare(leaf.keys[i], highestKey) > 0))
-      i++;
+    if (!(skipHighest || this._compare(leaf.keys[i], highestKey) > 0)) i++;
     var state = reusedArray !== undefined ? 1 : 0;
 
-    return iterator<[K,V]>(() => {
+    return iterator<[K, V]>(() => {
       jump: for (;;) {
-        switch(state) {
+        switch (state) {
           case 0:
             if (--i >= 0)
-              return {done: false, value: [leaf.keys[i], leaf.values[i]]};
+              return { done: false, value: [leaf.keys[i], leaf.values[i]] };
             state = 2;
             continue;
           case 1:
             if (--i >= 0) {
-              reusedArray![0] = leaf.keys[i], reusedArray![1] = leaf.values[i];
-              return {done: false, value: reusedArray as [K,V]};
+              (reusedArray![0] = leaf.keys[i]),
+                (reusedArray![1] = leaf.values[i]);
+              return { done: false, value: reusedArray as [K, V] };
             }
             state = 2;
           case 2:
             // Advance to the next leaf node
-            for (var level = -1;;) {
+            for (var level = -1; ; ) {
               if (++level >= nodequeue.length) {
-                state = 3; continue jump;
+                state = 3;
+                continue jump;
               }
-              if (--nodeindex[level] >= 0)
-                break;
+              if (--nodeindex[level] >= 0) break;
             }
             for (; level > 0; level--) {
-              nodequeue[level-1] = (nodequeue[level][nodeindex[level]] as BNodeInternal<K,V>).children;
-              nodeindex[level-1] = nodequeue[level-1].length-1;
+              nodequeue[level - 1] = (nodequeue[level][
+                nodeindex[level]
+              ] as BNodeInternal<K, V>).children;
+              nodeindex[level - 1] = nodequeue[level - 1].length - 1;
             }
             leaf = nodequeue[0][nodeindex[0]];
             i = leaf.keys.length;
             state = reusedArray !== undefined ? 1 : 0;
             continue;
           case 3:
-            return {done: true, value: undefined};
+            return { done: true, value: undefined };
         }
       }
     });
@@ -481,36 +564,39 @@ export default class BTree<K=any, V=any> implements ISortedMapF<K,V>, ISortedMap
 
   /* Used by entries() and entriesReversed() to prepare to start iterating.
    * It develops a "node queue" for each non-leaf level of the tree.
-   * Levels are numbered "bottom-up" so that level 0 is a list of leaf 
+   * Levels are numbered "bottom-up" so that level 0 is a list of leaf
    * nodes from a low-level non-leaf node. The queue at a given level L
-   * consists of nodequeue[L] which is the children of a BNodeInternal, 
+   * consists of nodequeue[L] which is the children of a BNodeInternal,
    * and nodeindex[L], the current index within that child list, such
    * such that nodequeue[L-1] === nodequeue[L][nodeindex[L]].children.
    * (However inside this function the order is reversed.)
    */
-  private findPath(key?: K): { nodequeue: BNode<K,V>[][], nodeindex: number[], leaf: BNode<K,V> } | undefined
-  {
+  private findPath(
+    key?: K,
+  ):
+    | { nodequeue: BNode<K, V>[][]; nodeindex: number[]; leaf: BNode<K, V> }
+    | undefined {
     var nextnode = this._root;
-    var nodequeue: BNode<K,V>[][], nodeindex: number[];
+    var nodequeue: BNode<K, V>[][], nodeindex: number[];
 
     if (nextnode.isLeaf) {
-      nodequeue = EmptyArray, nodeindex = EmptyArray; // avoid allocations
+      (nodequeue = EmptyArray), (nodeindex = EmptyArray); // avoid allocations
     } else {
-      nodequeue = [], nodeindex = [];
+      (nodequeue = []), (nodeindex = []);
       for (var d = 0; !nextnode.isLeaf; d++) {
-        nodequeue[d] = (nextnode as BNodeInternal<K,V>).children;
-        nodeindex[d] = key === undefined ? 0 : nextnode.indexOf(key, 0, this._compare);
-        if (nodeindex[d] >= nodequeue[d].length)
-          return; // first key > maxKey()
+        nodequeue[d] = (nextnode as BNodeInternal<K, V>).children;
+        nodeindex[d] =
+          key === undefined ? 0 : nextnode.indexOf(key, 0, this._compare);
+        if (nodeindex[d] >= nodequeue[d].length) return; // first key > maxKey()
         nextnode = nodequeue[d][nodeindex[d]];
       }
       nodequeue.reverse();
       nodeindex.reverse();
     }
-    return {nodequeue, nodeindex, leaf:nextnode};
+    return { nodequeue, nodeindex, leaf: nextnode };
   }
 
-  /** Returns a new iterator for iterating the keys of each pair in ascending order. 
+  /** Returns a new iterator for iterating the keys of each pair in ascending order.
    *  @param firstKey: Minimum key to include in the output. */
   keys(firstKey?: K): IterableIterator<K> {
     var it = this.entries(firstKey, ReusedArray);
@@ -520,8 +606,8 @@ export default class BTree<K=any, V=any> implements ISortedMapF<K,V>, ISortedMap
       return n;
     });
   }
-  
-  /** Returns a new iterator for iterating the values of each pair in order by key. 
+
+  /** Returns a new iterator for iterating the values of each pair in order by key.
    *  @param firstKey: Minimum key whose associated value is included in the output. */
   values(firstKey?: K): IterableIterator<V> {
     var it = this.entries(firstKey, ReusedArray);
@@ -540,57 +626,79 @@ export default class BTree<K=any, V=any> implements ISortedMapF<K,V>, ISortedMap
   }
 
   /** Gets the lowest key in the tree. Complexity: O(log size) */
-  minKey(): K | undefined { return this._root.minKey(); }
-  
+  minKey(): K | undefined {
+    return this._root.minKey();
+  }
+
   /** Gets the highest key in the tree. Complexity: O(1) */
-  maxKey(): K | undefined { return this._root.maxKey(); }
+  maxKey(): K | undefined {
+    return this._root.maxKey();
+  }
 
-  /** Quickly clones the tree by marking the root node as shared. 
+  /** Quickly clones the tree by marking the root node as shared.
    *  Both copies remain editable. When you modify either copy, any
    *  nodes that are shared (or potentially shared) between the two
    *  copies are cloned so that the changes do not affect other copies.
    *  This is known as copy-on-write behavior, or "lazy copying". */
-  clone(): BTree<K,V> {
+  clone(): BTree<K, V> {
     this._root.isShared = true;
-    var result = new BTree<K,V>(undefined, this._compare, this._maxNodeSize);
+    var result = new BTree<K, V>(undefined, this._compare, this._maxNodeSize);
     result._root = this._root;
     result._size = this._size;
     return result;
   }
 
-  /** Performs a greedy clone, immediately duplicating any nodes that are 
+  /** Performs a greedy clone, immediately duplicating any nodes that are
    *  not currently marked as shared, in order to avoid marking any nodes
    *  as shared.
    *  @param force Clone all nodes, even shared ones.
    */
-  greedyClone(force?: boolean): BTree<K,V> {
-    var result = new BTree<K,V>(undefined, this._compare, this._maxNodeSize);
+  greedyClone(force?: boolean): BTree<K, V> {
+    var result = new BTree<K, V>(undefined, this._compare, this._maxNodeSize);
     result._root = this._root.greedyClone(force);
     result._size = this._size;
     return result;
   }
 
   /** Gets an array filled with the contents of the tree, sorted by key */
-  toArray(maxLength: number = 0x7FFFFFFF): [K,V][] {
-    let min = this.minKey(), max = this.maxKey();
-    if (min !== undefined)
-      return this.getRange(min, max!, true, maxLength)
+  toArray(maxLength: number = 0x7fffffff): [K, V][] {
+    let min = this.minKey(),
+      max = this.maxKey();
+    if (min !== undefined) return this.getRange(min, max!, true, maxLength);
     return [];
   }
 
   /** Gets an array of all keys, sorted */
   keysArray() {
     var results: K[] = [];
-    this._root.forRange(this.minKey()!, this.maxKey()!, true, false, this, 0, 
-      (k,v) => { results.push(k); });
+    this._root.forRange(
+      this.minKey()!,
+      this.maxKey()!,
+      true,
+      false,
+      this,
+      0,
+      (k, v) => {
+        results.push(k);
+      },
+    );
     return results;
   }
-  
+
   /** Gets an array of all values, sorted by key */
   valuesArray() {
     var results: V[] = [];
-    this._root.forRange(this.minKey()!, this.maxKey()!, true, false, this, 0,
-      (k,v) => { results.push(v); });
+    this._root.forRange(
+      this.minKey()!,
+      this.maxKey()!,
+      true,
+      false,
+      this,
+      0,
+      (k, v) => {
+        results.push(v);
+      },
+    );
     return results;
   }
 
@@ -599,45 +707,44 @@ export default class BTree<K=any, V=any> implements ISortedMapF<K,V>, ISortedMap
     return this.toArray().toString();
   }
 
-  /** Stores a key-value pair only if the key doesn't already exist in the tree. 
+  /** Stores a key-value pair only if the key doesn't already exist in the tree.
    * @returns true if a new key was added
-  */
+   */
   setIfNotPresent(key: K, value: V): boolean {
     return this.set(key, value, false);
   }
 
   /** Returns the next pair whose key is larger than the specified key (or undefined if there is none) */
-  nextHigherPair(key: K): [K,V]|undefined {
+  nextHigherPair(key: K): [K, V] | undefined {
     var it = this.entries(key, ReusedArray);
     var r = it.next();
-    if (!r.done && this._compare(r.value[0], key) <= 0)
-      r = it.next();
+    if (!r.done && this._compare(r.value[0], key) <= 0) r = it.next();
     return r.value;
   }
-  
+
   /** Returns the next key larger than the specified key (or undefined if there is none) */
-  nextHigherKey(key: K): K|undefined {
+  nextHigherKey(key: K): K | undefined {
     var p = this.nextHigherPair(key);
     return p ? p[0] : p;
   }
 
   /** Returns the next pair whose key is smaller than the specified key (or undefined if there is none) */
-  nextLowerPair(key: K): [K,V]|undefined {
+  nextLowerPair(key: K): [K, V] | undefined {
     var it = this.entriesReversed(key, ReusedArray, true);
     return it.next().value;
   }
-  
+
   /** Returns the next key smaller than the specified key (or undefined if there is none) */
-  nextLowerKey(key: K): K|undefined {
+  nextLowerKey(key: K): K | undefined {
     var p = this.nextLowerPair(key);
     return p ? p[0] : p;
   }
 
-  /** Edits the value associated with a key in the tree, if it already exists. 
+  /** Edits the value associated with a key in the tree, if it already exists.
    * @returns true if the key existed, false if not.
-  */
-  changeIfPresent(key: K, value: V): boolean { 
-    return this.editRange(key, key, true, (k,v) => ({value})) !== 0;
+   */
+  changeIfPresent(key: K, value: V): boolean {
+    return this.editRange(key, key, true, (k, v) => ({ value })) !== 0;
   }
 
   /**
@@ -648,106 +755,154 @@ export default class BTree<K=any, V=any> implements ISortedMapF<K,V>, ISortedMap
    * @param includeHigh If the `high` key is present, its pair will be included
    *        in the output if and only if this parameter is true. Note: if the
    *        `low` key is present, it is always included in the output.
-   * @param maxLength Length limit. getRange will stop scanning the tree when 
+   * @param maxLength Length limit. getRange will stop scanning the tree when
    *                  the array reaches this size.
    * @description Computational complexity: O(result.length + log size)
    */
-  getRange(low: K, high: K, includeHigh?: boolean, maxLength: number = 0x3FFFFFF): [K,V][] {
-    var results: [K,V][] = [];
-    this._root.forRange(low, high, includeHigh, false, this, 0, (k,v) => {
-      results.push([k,v])
+  getRange(
+    low: K,
+    high: K,
+    includeHigh?: boolean,
+    maxLength: number = 0x3ffffff,
+  ): [K, V][] {
+    var results: [K, V][] = [];
+    this._root.forRange(low, high, includeHigh, false, this, 0, (k, v) => {
+      results.push([k, v]);
       return results.length > maxLength ? Break : undefined;
     });
     return results;
   }
 
   /** Adds all pairs from a list of key-value pairs.
-   * @param pairs Pairs to add to this tree. If there are duplicate keys, 
-   *        later pairs currently overwrite earlier ones (e.g. [[0,1],[0,7]] 
+   * @param pairs Pairs to add to this tree. If there are duplicate keys,
+   *        later pairs currently overwrite earlier ones (e.g. [[0,1],[0,7]]
    *        associates 0 with 7.)
    * @param overwrite Whether to overwrite pairs that already exist (if false,
    *        pairs[i] is ignored when the key pairs[i][0] already exists.)
    * @returns The number of pairs added to the collection.
    * @description Computational complexity: O(pairs.length * log(size + pairs.length))
    */
-  setPairs(pairs: [K,V][], overwrite?: boolean): number {
+  setPairs(pairs: [K, V][], overwrite?: boolean): number {
     var added = 0;
     for (var i = 0; i < pairs.length; i++)
-      if (this.set(pairs[i][0], pairs[i][1], overwrite))
-        added++;
+      if (this.set(pairs[i][0], pairs[i][1], overwrite)) added++;
     return added;
   }
 
-  forRange(low: K, high: K, includeHigh: boolean, onFound?: (k:K,v:V,counter:number) => void, initialCounter?: number): number;
+  forRange(
+    low: K,
+    high: K,
+    includeHigh: boolean,
+    onFound?: (k: K, v: V, counter: number) => void,
+    initialCounter?: number,
+  ): number;
 
   /**
    * Scans the specified range of keys, in ascending order by key.
    * Note: the callback `onFound` must not insert or remove items in the
-   * collection. Doing so may cause incorrect data to be sent to the 
+   * collection. Doing so may cause incorrect data to be sent to the
    * callback afterward.
    * @param low The first key scanned will be greater than or equal to `low`.
    * @param high Scanning stops when a key larger than this is reached.
    * @param includeHigh If the `high` key is present, `onFound` is called for
    *        that final pair if and only if this parameter is true.
-   * @param onFound A function that is called for each key-value pair. This 
+   * @param onFound A function that is called for each key-value pair. This
    *        function can return {break:R} to stop early with result R.
-   * @param initialCounter Initial third argument of onFound. This value 
+   * @param initialCounter Initial third argument of onFound. This value
    *        increases by one each time `onFound` is called. Default: 0
-   * @returns The number of values found, or R if the callback returned 
+   * @returns The number of values found, or R if the callback returned
    *        `{break:R}` to stop early.
    * @description Computational complexity: O(number of items scanned + log size)
    */
-  forRange<R=number>(low: K, high: K, includeHigh: boolean, onFound?: (k:K,v:V,counter:number) => {break?:R}|void, initialCounter?: number): R|number {
-    var r = this._root.forRange(low, high, includeHigh, false, this, initialCounter || 0, onFound);
+  forRange<R = number>(
+    low: K,
+    high: K,
+    includeHigh: boolean,
+    onFound?: (k: K, v: V, counter: number) => { break?: R } | void,
+    initialCounter?: number,
+  ): R | number {
+    var r = this._root.forRange(
+      low,
+      high,
+      includeHigh,
+      false,
+      this,
+      initialCounter || 0,
+      onFound,
+    );
     return typeof r === "number" ? r : r.break!;
   }
 
   /**
    * Scans and potentially modifies values for a subsequence of keys.
-   * Note: the callback `onFound` should ideally be a pure function. 
-   *   Specfically, it must not insert items, call clone(), or change 
+   * Note: the callback `onFound` should ideally be a pure function.
+   *   Specfically, it must not insert items, call clone(), or change
    *   the collection except via return value; out-of-band editing may
    *   cause an exception or may cause incorrect data to be sent to
-   *   the callback (duplicate or missed items). It must not cause a 
+   *   the callback (duplicate or missed items). It must not cause a
    *   clone() of the collection, otherwise the clone could be modified
    *   by changes requested by the callback.
    * @param low The first key scanned will be greater than or equal to `low`.
    * @param high Scanning stops when a key larger than this is reached.
    * @param includeHigh If the `high` key is present, `onFound` is called for
    *        that final pair if and only if this parameter is true.
-   * @param onFound A function that is called for each key-value pair. This 
-   *        function can return `{value:v}` to change the value associated 
+   * @param onFound A function that is called for each key-value pair. This
+   *        function can return `{value:v}` to change the value associated
    *        with the current key, `{delete:true}` to delete the current pair,
    *        `{break:R}` to stop early with result R, or it can return nothing
    *        (undefined or {}) to cause no effect and continue iterating.
    *        `{break:R}` can be combined with one of the other two commands.
-   *        The third argument `counter` is the number of items iterated 
+   *        The third argument `counter` is the number of items iterated
    *        previously; it equals 0 when `onFound` is called the first time.
-   * @returns The number of values scanned, or R if the callback returned 
+   * @returns The number of values scanned, or R if the callback returned
    *        `{break:R}` to stop early.
-   * @description 
+   * @description
    *   Computational complexity: O(number of items scanned + log size)
    *   Note: if the tree has been cloned with clone(), any shared
-   *   nodes are copied before `onFound` is called. This takes O(n) time 
+   *   nodes are copied before `onFound` is called. This takes O(n) time
    *   where n is proportional to the amount of shared data scanned.
    */
-  editRange<R=V>(low: K, high: K, includeHigh: boolean, onFound: (k:K,v:V,counter:number) => EditRangeResult<V,R>|void, initialCounter?: number): R|number {
+  editRange<R = V>(
+    low: K,
+    high: K,
+    includeHigh: boolean,
+    onFound: (k: K, v: V, counter: number) => EditRangeResult<V, R> | void,
+    initialCounter?: number,
+  ): R | number {
     var root = this._root;
-    if (root.isShared)
-      this._root = root = root.clone();
+    if (root.isShared) this._root = root = root.clone();
     try {
-      var r = root.forRange(low, high, includeHigh, true, this, initialCounter || 0, onFound);
+      var r = root.forRange(
+        low,
+        high,
+        includeHigh,
+        true,
+        this,
+        initialCounter || 0,
+        onFound,
+      );
       return typeof r === "number" ? r : r.break!;
     } finally {
       while (root.keys.length <= 1 && !root.isLeaf)
-        this._root = root = root.keys.length === 0 ? EmptyLeaf :
-                    (root as any as BNodeInternal<K,V>).children[0];
+        this._root = root =
+          root.keys.length === 0
+            ? EmptyLeaf
+            : ((root as any) as BNodeInternal<K, V>).children[0];
     }
   }
 
   /** Same as `editRange` except that the callback is called for all pairs. */
-  editAll<R=V>(onFound: (k:K,v:V,counter:number) => EditRangeResult<V,R>|void, initialCounter?: number): R|number {
-    return this.editRange(this.minKey()!, this.maxKey()!, true, onFound, initialCounter);
+  editAll<R = V>(
+    onFound: (k: K, v: V, counter: number) => EditRangeResult<V, R> | void,
+    initialCounter?: number,
+  ): R | number {
+    return this.editRange(
+      this.minKey()!,
+      this.maxKey()!,
+      true,
+      onFound,
+      initialCounter,
+    );
   }
 
   /**
@@ -764,13 +919,11 @@ export default class BTree<K=any, V=any> implements ISortedMapF<K,V>, ISortedMap
 
   /** Deletes a series of keys from the collection. */
   deleteKeys(keys: K[]): number {
-    for (var i = 0, r = 0; i < keys.length; i++)
-      if (this.delete(keys[i]))
-        r++;
+    for (var i = 0, r = 0; i < keys.length; i++) if (this.delete(keys[i])) r++;
     return r;
   }
 
-  /** Gets the height of the tree: the number of internal nodes between the 
+  /** Gets the height of the tree: the number of internal nodes between the
    *  BTree object and its leaf nodes (zero if there are no internal nodes). */
   get height(): number {
     for (var node = this._root, h = -1; node != null; h++)
@@ -780,15 +933,15 @@ export default class BTree<K=any, V=any> implements ISortedMapF<K,V>, ISortedMap
 
   /** Makes the object read-only to ensure it is not accidentally modified.
    *  Freezing does not have to be permanent; unfreeze() reverses the effect.
-   *  This is accomplished by replacing mutator functions with a function 
-   *  that throws an Error. Compared to using a property (e.g. this.isFrozen) 
+   *  This is accomplished by replacing mutator functions with a function
+   *  that throws an Error. Compared to using a property (e.g. this.isFrozen)
    *  this implementation gives better performance in non-frozen BTrees.
    */
   freeze() {
     var t = this as any;
-    // Note: all other mutators ultimately call set() or editRange() 
+    // Note: all other mutators ultimately call set() or editRange()
     //       so we don't need to override those others.
-    t.clear = t.set = t.editRange = function() {
+    t.clear = t.set = t.editRange = function () {
       throw new Error("Attempted to modify a frozen BTree");
     };
   }
@@ -802,7 +955,7 @@ export default class BTree<K=any, V=any> implements ISortedMapF<K,V>, ISortedMap
 
   /** Returns true if the tree appears to be frozen. */
   get isFrozen() {
-    return this.hasOwnProperty('editRange');
+    return this.hasOwnProperty("editRange");
   }
 
   /** Scans the tree for signs of serious bugs (e.g. this.size doesn't match
@@ -812,65 +965,81 @@ export default class BTree<K=any, V=any> implements ISortedMapF<K,V>, ISortedMap
    *  does check that maxKey() of the children of internal nodes are sorted. */
   checkValid() {
     var size = this._root.checkValid(0, this);
-    check(size === this.size, "size mismatch: counted ", size, "but stored", this.size);
+    check(
+      size === this.size,
+      "size mismatch: counted ",
+      size,
+      "but stored",
+      this.size,
+    );
   }
 }
 
 declare const Symbol: any;
-if (Symbol && Symbol.iterator) // iterator is equivalent to entries()
+if (Symbol && Symbol.iterator)
+  // iterator is equivalent to entries()
   (BTree as any).prototype[Symbol.iterator] = BTree.prototype.entries;
 (BTree as any).prototype.where = BTree.prototype.filter;
 (BTree as any).prototype.setRange = BTree.prototype.setPairs;
 (BTree as any).prototype.add = BTree.prototype.set;
 
-function iterator<T>(next: () => {done?:boolean,value?:T} = (() => ({ done:true, value:undefined }))): IterableIterator<T> {
+function iterator<T>(
+  next: () => { done?: boolean; value?: T } = () => ({
+    done: true,
+    value: undefined,
+  }),
+): IterableIterator<T> {
   var result: any = { next };
   if (Symbol && Symbol.iterator)
-    result[Symbol.iterator] = function() { return this; };
+    result[Symbol.iterator] = function () {
+      return this;
+    };
   return result;
 }
-  
 
 /** Leaf node / base class. **************************************************/
-class BNode<K,V> {
+class BNode<K, V> {
   // If this is an internal node, _keys[i] is the highest key in children[i].
   keys: K[];
   values: V[];
   isShared: true | undefined;
-  get isLeaf() { return (this as any).children === undefined; }
-  
+  get isLeaf() {
+    return (this as any).children === undefined;
+  }
+
   constructor(keys: K[] = [], values?: V[]) {
     this.keys = keys;
-    this.values = values || undefVals as any[];
+    this.values = values || (undefVals as any[]);
     this.isShared = undefined;
   }
 
   // Shared methods /////////////////////////////////////////////////////////
 
   maxKey() {
-    return this.keys[this.keys.length-1];
+    return this.keys[this.keys.length - 1];
   }
 
   // If key not found, returns i^failXor where i is the insertion index.
   // Callers that don't care whether there was a match will set failXor=0.
-  indexOf(key: K, failXor: number, cmp: (a:K, b:K) => number): index {
+  indexOf(key: K, failXor: number, cmp: (a: K, b: K) => number): index {
     // TODO: benchmark multiple search strategies
     const keys = this.keys;
-    var lo = 0, hi = keys.length, mid = hi >> 1;
-    while(lo < hi) {
+    var lo = 0,
+      hi = keys.length,
+      mid = hi >> 1;
+    while (lo < hi) {
       var c = cmp(keys[mid], key);
-      if (c < 0)
-        lo = mid + 1;
-      else if (c > 0) // key < keys[mid]
+      if (c < 0) lo = mid + 1;
+      else if (c > 0)
+        // key < keys[mid]
         hi = mid;
-      else if (c === 0)
-        return mid;
+      else if (c === 0) return mid;
       else {
         // c is NaN or otherwise invalid
-        if (key === key) // at least the search key is not NaN
+        if (key === key)
+          // at least the search key is not NaN
           return keys.length;
-        else
-          throw new Error("BTree: NaN was used as a key");
+        else throw new Error("BTree: NaN was used as a key");
       }
       mid = (lo + hi) >> 1;
     }
@@ -928,26 +1097,36 @@ class BNode<K,V> {
     return this.keys[0];
   }
 
-  clone(): BNode<K,V> {
+  clone(): BNode<K, V> {
     var v = this.values;
-    return new BNode<K,V>(this.keys.slice(0), v === undefVals ? v : v.slice(0));
+    return new BNode<K, V>(
+      this.keys.slice(0),
+      v === undefVals ? v : v.slice(0),
+    );
   }
 
-  greedyClone(force?: boolean): BNode<K,V> {
+  greedyClone(force?: boolean): BNode<K, V> {
     return this.isShared && !force ? this : this.clone();
   }
 
-  get(key: K, defaultValue: V|undefined, tree: BTree<K,V>): V|undefined {
+  get(key: K, defaultValue: V | undefined, tree: BTree<K, V>): V | undefined {
     var i = this.indexOf(key, -1, tree._compare);
     return i < 0 ? defaultValue : this.values[i];
   }
 
-  checkValid(depth: number, tree: BTree<K,V>): number {
-    var kL = this.keys.length, vL = this.values.length;
-    check(this.values === undefVals ? kL <= vL : kL === vL,
-      "keys/values length mismatch: depth", depth, "with lengths", kL, vL);
+  checkValid(depth: number, tree: BTree<K, V>): number {
+    var kL = this.keys.length,
+      vL = this.values.length;
+    check(
+      this.values === undefVals ? kL <= vL : kL === vL,
+      "keys/values length mismatch: depth",
+      depth,
+      "with lengths",
+      kL,
+      vL,
+    );
     // Note: we don't check for "node too small" because sometimes a node
-    // can legitimately have size 1. This occurs if there is a batch 
+    // can legitimately have size 1. This occurs if there is a batch
     // deletion, leaving a node of size 1, and the siblings are full so
     // it can't be merged with adjacent nodes. However, the parent will
     // verify that the average node size is at least half of the maximum.
@@ -957,18 +1136,24 @@ class BNode<K,V> {
 
   // Leaf Node: set & node splitting //////////////////////////////////////////
 
-  set(key: K, value: V, overwrite: boolean|undefined, tree: BTree<K,V>): boolean|BNode<K,V> { 
+  set(
+    key: K,
+    value: V,
+    overwrite: boolean | undefined,
+    tree: BTree<K, V>,
+  ): boolean | BNode<K, V> {
     var i = this.indexOf(key, -1, tree._compare);
     if (i < 0) {
       // key does not exist yet
       i = ~i;
       tree._size++;
-      
+
       if (this.keys.length < tree._maxNodeSize) {
         return this.insertInLeaf(i, key, value, tree);
       } else {
         // This leaf node is full and must split
-        var newRightSibling = this.splitOffRightSide(), target: BNode<K,V> = this;
+        var newRightSibling = this.splitOffRightSide(),
+          target: BNode<K, V> = this;
         if (i > this.keys.length) {
           i -= this.keys.length;
           target = newRightSibling;
@@ -979,8 +1164,7 @@ class BNode<K,V> {
     } else {
       // Key already exists
       if (overwrite !== false) {
-        if (value !== undefined)
-          this.reifyValues();
+        if (value !== undefined) this.reifyValues();
         // usually this is a no-op, but some users may wish to edit the key
         this.keys[i] = key;
         this.values[i] = value;
@@ -991,15 +1175,14 @@ class BNode<K,V> {
 
   reifyValues() {
     if (this.values === undefVals)
-      return this.values = this.values.slice(0, this.keys.length);
+      return (this.values = this.values.slice(0, this.keys.length));
     return this.values;
   }
 
-  insertInLeaf(i: index, key: K, value: V, tree: BTree<K,V>) {
+  insertInLeaf(i: index, key: K, value: V, tree: BTree<K, V>) {
     this.keys.splice(i, 0, key);
     if (this.values === undefVals) {
-      while (undefVals.length < tree._maxNodeSize)
-        undefVals.push(undefined);
+      while (undefVals.length < tree._maxNodeSize) undefVals.push(undefined);
       if (value === undefined) {
         return true;
       } else {
@@ -1009,15 +1192,14 @@ class BNode<K,V> {
     this.values.splice(i, 0, value);
     return true;
   }
-  
-  takeFromRight(rhs: BNode<K,V>) {
+
+  takeFromRight(rhs: BNode<K, V>) {
     // Reminder: parent node must update its copy of key for this node
     // assert: neither node is shared
     // assert rhs.keys.length > (maxNodeSize/2 && this.keys.length<maxNodeSize)
     var v = this.values;
     if (rhs.values === undefVals) {
-      if (v !== undefVals)
-        v.push(undefined as any);
+      if (v !== undefVals) v.push(undefined as any);
     } else {
       v = this.reifyValues();
       v.push(rhs.values.shift()!);
@@ -1025,14 +1207,13 @@ class BNode<K,V> {
     this.keys.push(rhs.keys.shift()!);
   }
 
-  takeFromLeft(lhs: BNode<K,V>) {
+  takeFromLeft(lhs: BNode<K, V>) {
     // Reminder: parent node must update its copy of key for this node
     // assert: neither node is shared
     // assert rhs.keys.length > (maxNodeSize/2 && this.keys.length<maxNodeSize)
     var v = this.values;
     if (lhs.values === undefVals) {
-      if (v !== undefVals)
-        v.unshift(undefined as any);
+      if (v !== undefVals) v.unshift(undefined as any);
     } else {
       v = this.reifyValues();
       v.unshift(lhs.values.pop()!);
@@ -1040,36 +1221,42 @@ class BNode<K,V> {
     this.keys.unshift(lhs.keys.pop()!);
   }
 
-  splitOffRightSide(): BNode<K,V> {
+  splitOffRightSide(): BNode<K, V> {
     // Reminder: parent node must update its copy of key for this node
-    var half = this.keys.length >> 1, keys = this.keys.splice(half);
-    var values = this.values === undefVals ? undefVals : this.values.splice(half);
-    return new BNode<K,V>(keys, values);
+    var half = this.keys.length >> 1,
+      keys = this.keys.splice(half);
+    var values =
+      this.values === undefVals ? undefVals : this.values.splice(half);
+    return new BNode<K, V>(keys, values);
   }
 
   // Leaf Node: scanning & deletions //////////////////////////////////////////
 
-  forRange<R>(low: K, high: K, includeHigh: boolean|undefined, editMode: boolean, tree: BTree<K,V>, count: number,
-              onFound?: (k:K, v:V, counter:number) => EditRangeResult<V,R>|void): EditRangeResult<V,R>|number {
+  forRange<R>(
+    low: K,
+    high: K,
+    includeHigh: boolean | undefined,
+    editMode: boolean,
+    tree: BTree<K, V>,
+    count: number,
+    onFound?: (k: K, v: V, counter: number) => EditRangeResult<V, R> | void,
+  ): EditRangeResult<V, R> | number {
     var cmp = tree._compare;
     var iLow, iHigh;
     if (high === low) {
-      if (!includeHigh)
-        return count;
+      if (!includeHigh) return count;
       iHigh = (iLow = this.indexOf(low, -1, cmp)) + 1;
-      if (iLow < 0)
-        return count;
+      if (iLow < 0) return count;
     } else {
       iLow = this.indexOf(low, 0, cmp);
       iHigh = this.indexOf(high, -1, cmp);
-      if (iHigh < 0)
-        iHigh = ~iHigh;
-      else if (includeHigh === true)
-        iHigh++;
+      if (iHigh < 0) iHigh = ~iHigh;
+      else if (includeHigh === true) iHigh++;
     }
-    var keys = this.keys, values = this.values;
+    var keys = this.keys,
+      values = this.values;
     if (onFound !== undefined) {
-      for(var i = iLow; i < iHigh; i++) {
+      for (var i = iLow; i < iHigh; i++) {
         var key = keys[i];
         var result = onFound(key, values[i], count++);
         if (result !== undefined) {
@@ -1078,30 +1265,26 @@ class BNode<K,V> {
               throw new Error("BTree illegally changed or cloned in editRange");
             if (result.delete) {
               this.keys.splice(i, 1);
-              if (this.values !== undefVals)
-                this.values.splice(i, 1);
+              if (this.values !== undefVals) this.values.splice(i, 1);
               tree._size--;
               i--;
               iHigh--;
-            } else if (result.hasOwnProperty('value')) {
+            } else if (result.hasOwnProperty("value")) {
               values![i] = result.value!;
             }
           }
-          if (result.break !== undefined)
-            return result;
+          if (result.break !== undefined) return result;
         }
       }
-    } else
-      count += iHigh - iLow;
+    } else count += iHigh - iLow;
     return count;
   }
 
   /** Adds entire contents of right-hand sibling (rhs is left unchanged) */
-  mergeSibling(rhs: BNode<K,V>, _: number) {
+  mergeSibling(rhs: BNode<K, V>, _: number) {
     this.keys.push.apply(this.keys, rhs.keys);
     if (this.values === undefVals) {
-      if (rhs.values === undefVals)
-        return;
+      if (rhs.values === undefVals) return;
       this.values = this.values.slice(0, this.keys.length);
     }
     this.values.push.apply(this.values, rhs.reifyValues());
@@ -1109,33 +1292,33 @@ class BNode<K,V> {
 }
 
 /** Internal node (non-leaf node) ********************************************/
-class BNodeInternal<K,V> extends BNode<K,V> {
-  // Note: conventionally B+ trees have one fewer key than the number of 
+class BNodeInternal<K, V> extends BNode<K, V> {
+  // Note: conventionally B+ trees have one fewer key than the number of
   // children, but I find it easier to keep the array lengths equal: each
   // keys[i] caches the value of children[i].maxKey().
-  children: BNode<K,V>[];
+  children: BNode<K, V>[];
 
-  constructor(children: BNode<K,V>[], keys?: K[]) {
+  constructor(children: BNode<K, V>[], keys?: K[]) {
     if (!keys) {
       keys = [];
-      for (var i = 0; i < children.length; i++)
-        keys[i] = children[i].maxKey();
+      for (var i = 0; i < children.length; i++) keys[i] = children[i].maxKey();
     }
     super(keys);
     this.children = children;
   }
 
-  clone(): BNode<K,V> {
+  clone(): BNode<K, V> {
     var children = this.children.slice(0);
-    for (var i = 0; i < children.length; i++)
-      children[i].isShared = true;
-    return new BNodeInternal<K,V>(children, this.keys.slice(0));
+    for (var i = 0; i < children.length; i++) children[i].isShared = true;
+    return new BNodeInternal<K, V>(children, this.keys.slice(0));
   }
 
-  greedyClone(force?: boolean): BNode<K,V> {
-    if (this.isShared && !force)
-      return this;
-    var nu = new BNodeInternal<K,V>(this.children.slice(0), this.keys.slice(0));
+  greedyClone(force?: boolean): BNode<K, V> {
+    if (this.isShared && !force) return this;
+    var nu = new BNodeInternal<K, V>(
+      this.children.slice(0),
+      this.keys.slice(0),
+    );
     for (var i = 0; i < nu.children.length; i++)
       nu.children[i] = nu.children[i].greedyClone();
     return nu;
@@ -1145,141 +1328,229 @@ class BNodeInternal<K,V> extends BNode<K,V> {
     return this.children[0].minKey();
   }
 
-  get(key: K, defaultValue: V|undefined, tree: BTree<K,V>): V|undefined {
-    var i = this.indexOf(key, 0, tree._compare), children = this.children;
-    return i < children.length ? children[i].get(key, defaultValue, tree) : undefined;
-  }
-
-  checkValid(depth: number, tree: BTree<K,V>) : number {
-    var kL = this.keys.length, cL = this.children.length;
-    check(kL === cL, "keys/children length mismatch: depth", depth, "lengths", kL, cL);
+  get(key: K, defaultValue: V | undefined, tree: BTree<K, V>): V | undefined {
+    var i = this.indexOf(key, 0, tree._compare),
+      children = this.children;
+    return i < children.length
+      ? children[i].get(key, defaultValue, tree)
+      : undefined;
+  }
+
+  checkValid(depth: number, tree: BTree<K, V>): number {
+    var kL = this.keys.length,
+      cL = this.children.length;
+    check(
+      kL === cL,
+      "keys/children length mismatch: depth",
+      depth,
+      "lengths",
+      kL,
+      cL,
+    );
     check(kL > 1, "internal node has length", kL, "at depth", depth);
-    var size = 0, c = this.children, k = this.keys, childSize = 0;
+    var size = 0,
+      c = this.children,
+      k = this.keys,
+      childSize = 0;
     for (var i = 0; i < cL; i++) {
       size += c[i].checkValid(depth + 1, tree);
       childSize += c[i].keys.length;
       check(size >= childSize, "wtf"); // no way this will ever fail
-      check(i === 0 || c[i-1].constructor === c[i].constructor, "type mismatch");
+      check(
+        i === 0 || c[i - 1].constructor === c[i].constructor,
+        "type mismatch",
+      );
       if (c[i].maxKey() != k[i])
-        check(false, "keys[", i, "] =", k[i], "is wrong, should be ", c[i].maxKey(), "at depth", depth);
-      if (!(i === 0 || tree._compare(k[i-1], k[i]) < 0))
-        check(false, "sort violation at depth", depth, "index", i, "keys", k[i-1], k[i]);
+        check(
+          false,
+          "keys[",
+          i,
+          "] =",
+          k[i],
+          "is wrong, should be ",
+          c[i].maxKey(),
+          "at depth",
+          depth,
+        );
+      if (!(i === 0 || tree._compare(k[i - 1], k[i]) < 0))
+        check(
+          false,
+          "sort violation at depth",
+          depth,
+          "index",
+          i,
+          "keys",
+          k[i - 1],
+          k[i],
+        );
     }
-    var toofew = childSize < (tree.maxNodeSize >> 1)*cL;
-    if (toofew || childSize > tree.maxNodeSize*cL)
-      check(false, toofew ? "too few" : "too many", "children (", childSize, size, ") at depth", depth, ", maxNodeSize:", tree.maxNodeSize, "children.length:", cL);
+    var toofew = childSize < (tree.maxNodeSize >> 1) * cL;
+    if (toofew || childSize > tree.maxNodeSize * cL)
+      check(
+        false,
+        toofew ? "too few" : "too many",
+        "children (",
+        childSize,
+        size,
+        ") at depth",
+        depth,
+        ", maxNodeSize:",
+        tree.maxNodeSize,
+        "children.length:",
+        cL,
+      );
     return size;
   }
 
   // Internal Node: set & node splitting //////////////////////////////////////
 
-  set(key: K, value: V, overwrite: boolean|undefined, tree: BTree<K,V>): boolean|BNodeInternal<K,V> {
-    var c = this.children, max = tree._maxNodeSize, cmp = tree._compare;
-    var i = Math.min(this.indexOf(key, 0, cmp), c.length - 1), child = c[i];
-    
-    if (child.isShared)
-      c[i] = child = child.clone();
+  set(
+    key: K,
+    value: V,
+    overwrite: boolean | undefined,
+    tree: BTree<K, V>,
+  ): boolean | BNodeInternal<K, V> {
+    var c = this.children,
+      max = tree._maxNodeSize,
+      cmp = tree._compare;
+    var i = Math.min(this.indexOf(key, 0, cmp), c.length - 1),
+      child = c[i];
+
+    if (child.isShared) c[i] = child = child.clone();
     if (child.keys.length >= max) {
       // child is full; inserting anything else will cause a split.
       // Shifting an item to the left or right sibling may avoid a split.
       // We can do a shift if the adjacent node is not full and if the
       // current key can still be placed in the same node after the shift.
-      var other: BNode<K,V>;
-      if (i > 0 && (other = c[i-1]).keys.length < max && cmp(child.keys[0], key) < 0) {
-        if (other.isShared)
-          c[i-1] = other = other.clone();
+      var other: BNode<K, V>;
+      if (
+        i > 0 &&
+        (other = c[i - 1]).keys.length < max &&
+        cmp(child.keys[0], key) < 0
+      ) {
+        if (other.isShared) c[i - 1] = other = other.clone();
         other.takeFromRight(child);
-        this.keys[i-1] = other.maxKey();
-      } else if ((other = c[i+1]) !== undefined && other.keys.length < max && cmp(child.maxKey(), key) < 0) {
-        if (other.isShared)
-          c[i+1] = other = other.clone();
+        this.keys[i - 1] = other.maxKey();
+      } else if (
+        (other = c[i + 1]) !== undefined &&
+        other.keys.length < max &&
+        cmp(child.maxKey(), key) < 0
+      ) {
+        if (other.isShared) c[i + 1] = other = other.clone();
         other.takeFromLeft(child);
         this.keys[i] = c[i].maxKey();
       }
     }
 
     var result = child.set(key, value, overwrite, tree);
-    if (result === false)
-      return false;
+    if (result === false) return false;
     this.keys[i] = child.maxKey();
-    if (result === true)
-      return true;
+    if (result === true) return true;
 
     // The child has split and `result` is a new right child... does it fit?
-    if (this.keys.length < max) { // yes
-      this.insert(i+1, result);
+    if (this.keys.length < max) {
+      // yes
+      this.insert(i + 1, result);
       return true;
-    } else { // no, we must split also
-      var newRightSibling = this.splitOffRightSide(), target: BNodeInternal<K,V> = this;
+    } else {
+      // no, we must split also
+      var newRightSibling = this.splitOffRightSide(),
+        target: BNodeInternal<K, V> = this;
       if (cmp(result.maxKey(), this.maxKey()) > 0) {
         target = newRightSibling;
         i -= this.keys.length;
       }
-      target.insert(i+1, result);
+      target.insert(i + 1, result);
       return newRightSibling;
     }
   }
 
-  insert(i: index, child: BNode<K,V>) {
+  insert(i: index, child: BNode<K, V>) {
     this.children.splice(i, 0, child);
     this.keys.splice(i, 0, child.maxKey());
   }
 
   splitOffRightSide() {
     var half = this.children.length >> 1;
-    return new BNodeInternal<K,V>(this.children.splice(half), this.keys.splice(half));
+    return new BNodeInternal<K, V>(
+      this.children.splice(half),
+      this.keys.splice(half),
+    );
   }
 
-  takeFromRight(rhs: BNode<K,V>) {
+  takeFromRight(rhs: BNode<K, V>) {
     // Reminder: parent node must update its copy of key for this node
     // assert: neither node is shared
     // assert rhs.keys.length > (maxNodeSize/2 && this.keys.length<maxNodeSize)
     this.keys.push(rhs.keys.shift()!);
-    this.children.push((rhs as BNodeInternal<K,V>).children.shift()!);
+    this.children.push((rhs as BNodeInternal<K, V>).children.shift()!);
   }
 
-  takeFromLeft(lhs: BNode<K,V>) {
+  takeFromLeft(lhs: BNode<K, V>) {
     // Reminder: parent node must update its copy of key for this node
     // assert: neither node is shared
     // assert rhs.keys.length > (maxNodeSize/2 && this.keys.length<maxNodeSize)
     this.keys.unshift(lhs.keys.pop()!);
-    this.children.unshift((lhs as BNodeInternal<K,V>).children.pop()!);
+    this.children.unshift((lhs as BNodeInternal<K, V>).children.pop()!);
   }
 
   // Internal Node: scanning & deletions //////////////////////////////////////
 
-  forRange<R>(low: K, high: K, includeHigh: boolean|undefined, editMode: boolean, tree: BTree<K,V>, count: number,
-    onFound?: (k:K, v:V, counter:number) => EditRangeResult<V,R>|void): EditRangeResult<V,R>|number
-  {
+  forRange<R>(
+    low: K,
+    high: K,
+    includeHigh: boolean | undefined,
+    editMode: boolean,
+    tree: BTree<K, V>,
+    count: number,
+    onFound?: (k: K, v: V, counter: number) => EditRangeResult<V, R> | void,
+  ): EditRangeResult<V, R> | number {
     var cmp = tree._compare;
-    var iLow = this.indexOf(low, 0, cmp), i = iLow;
-    var iHigh = Math.min(high === low ? iLow : this.indexOf(high, 0, cmp), this.keys.length-1);
-    var keys = this.keys, children = this.children;
+    var iLow = this.indexOf(low, 0, cmp),
+      i = iLow;
+    var iHigh = Math.min(
+      high === low ? iLow : this.indexOf(high, 0, cmp),
+      this.keys.length - 1,
+    );
+    var keys = this.keys,
+      children = this.children;
     if (!editMode) {
       // Simple case
-      for(; i <= iHigh; i++) {
-        var result = children[i].forRange(low, high, includeHigh, editMode, tree, count, onFound);
-        if (typeof result !== 'number')
-          return result;
+      for (; i <= iHigh; i++) {
+        var result = children[i].forRange(
+          low,
+          high,
+          includeHigh,
+          editMode,
+          tree,
+          count,
+          onFound,
+        );
+        if (typeof result !== "number") return result;
         count = result;
       }
     } else if (i <= iHigh) {
       try {
-        for(; i <= iHigh; i++) {
-          if (children[i].isShared)
-            children[i] = children[i].clone();
-          var result = children[i].forRange(low, high, includeHigh, editMode, tree, count, onFound);
+        for (; i <= iHigh; i++) {
+          if (children[i].isShared) children[i] = children[i].clone();
+          var result = children[i].forRange(
+            low,
+            high,
+            includeHigh,
+            editMode,
+            tree,
+            count,
+            onFound,
+          );
           keys[i] = children[i].maxKey();
-          if (typeof result !== 'number')
-            return result;
+          if (typeof result !== "number") return result;
           count = result;
         }
       } finally {
         // Deletions may have occurred, so look for opportunities to merge nodes.
         var half = tree._maxNodeSize >> 1;
-        if (iLow > 0)
-          iLow--;
-        for(i = iHigh; i >= iLow; i--) {
+        if (iLow > 0) iLow--;
+        for (i = iHigh; i >= iLow; i--) {
           if (children[i].keys.length <= half)
             this.tryMerge(i, tree._maxNodeSize);
         }
@@ -1298,10 +1569,11 @@ class BNodeInternal<K,V> extends BNode<K,V> {
   tryMerge(i: index, maxSize: number): boolean {
     var children = this.children;
     if (i >= 0 && i + 1 < children.length) {
-      if (children[i].keys.length + children[i+1].keys.length <= maxSize) {
-        if (children[i].isShared) // cloned already UNLESS i is outside scan range
+      if (children[i].keys.length + children[i + 1].keys.length <= maxSize) {
+        if (children[i].isShared)
+          // cloned already UNLESS i is outside scan range
           children[i] = children[i].clone();
-        children[i].mergeSibling(children[i+1], maxSize);
+        children[i].mergeSibling(children[i + 1], maxSize);
         children.splice(i + 1, 1);
         this.keys.splice(i + 1, 1);
         this.keys[i] = children[i].maxKey();
@@ -1311,15 +1583,18 @@ class BNodeInternal<K,V> extends BNode<K,V> {
     return false;
   }
 
-  mergeSibling(rhs: BNode<K,V>, maxNodeSize: number) {
+  mergeSibling(rhs: BNode<K, V>, maxNodeSize: number) {
     // assert !this.isShared;
     var oldLength = this.keys.length;
     this.keys.push.apply(this.keys, rhs.keys);
-    this.children.push.apply(this.children, (rhs as any as BNodeInternal<K,V>).children);
+    this.children.push.apply(
+      this.children,
+      ((rhs as any) as BNodeInternal<K, V>).children,
+    );
     // If our children are themselves almost empty due to a mass-delete,
     // they may need to be merged too (but only the oldLength-1 and its
     // right sibling should need this).
-    this.tryMerge(oldLength-1, maxNodeSize);
+    this.tryMerge(oldLength - 1, maxNodeSize);
   }
 }
 
@@ -1332,20 +1607,27 @@ class BNodeInternal<K,V> extends BNode<K,V> {
 // users from making this array too large, BTree has a maximum node size.
 var undefVals: any[] = [];
 
-const Delete = {delete: true}, DeleteRange = () => Delete;
-const Break = {break: true};
-const EmptyLeaf = (function() { 
-  var n = new BNode<any,any>(); n.isShared = true; return n;
+const Delete = { delete: true },
+  DeleteRange = () => Delete;
+const Break = { break: true };
+const EmptyLeaf = (function () {
+  var n = new BNode<any, any>();
+  n.isShared = true;
+  return n;
 })();
 const EmptyArray: any[] = [];
 const ReusedArray: any[] = []; // assumed thread-local
 
 function check(fact: boolean, ...args: any[]) {
   if (!fact) {
-    args.unshift('B+ tree '); // at beginning of message
-    throw new Error(args.join(' '));
+    args.unshift("B+ tree "); // at beginning of message
+    throw new Error(args.join(" "));
   }
 }
 
 /** A BTree frozen in the empty state. */
-export const EmptyBTree = (() => { let t = new BTree(); t.freeze(); return t; })();
+export const EmptyBTree = (() => {
+  let t = new BTree();
+  t.freeze();
+  return t;
+})();
diff --git a/packages/idb-bridge/src/tree/interfaces.ts b/packages/idb-bridge/src/tree/interfaces.ts
index 6bd0cdf58..ce8808d09 100644
--- a/packages/idb-bridge/src/tree/interfaces.ts
+++ b/packages/idb-bridge/src/tree/interfaces.ts
@@ -24,15 +24,13 @@ SPDX-License-Identifier: MIT
 
 // Original repository: https://github.com/qwertie/btree-typescript
 
-
 /** Read-only set interface (subinterface of IMapSource<K,any>).
  *  The word "set" usually means that each item in the collection is unique
- *  (appears only once, based on a definition of equality used by the 
- *  collection.) Objects conforming to this interface aren't guaranteed not 
- *  to contain duplicates, but as an example, BTree<K,V> implements this 
+ *  (appears only once, based on a definition of equality used by the
+ *  collection.) Objects conforming to this interface aren't guaranteed not
+ *  to contain duplicates, but as an example, BTree<K,V> implements this
  *  interface and does not allow duplicates. */
-export interface ISetSource<K=any>
-{
+export interface ISetSource<K = any> {
   /** Returns the number of key/value pairs in the map object. */
   size: number;
   /** Returns a boolean asserting whether the key exists in the map object or not. */
@@ -42,21 +40,23 @@ export interface ISetSource<K=any>
 }
 
 /** Read-only map interface (i.e. a source of key-value pairs). */
-export interface IMapSource<K=any, V=any> extends ISetSource<K>
-{
+export interface IMapSource<K = any, V = any> extends ISetSource<K> {
   /** Returns the number of key/value pairs in the map object. */
   size: number;
   /** Returns the value associated to the key, or undefined if there is none. */
-  get(key: K): V|undefined;
+  get(key: K): V | undefined;
   /** Returns a boolean asserting whether the key exists in the map object or not. */
   has(key: K): boolean;
   /** Calls callbackFn once for each key-value pair present in the map object.
    *  The ES6 Map class sends the value to the callback before the key, so
    *  this interface must do likewise. */
-  forEach(callbackFn: (v:V, k:K, map:IMapSource<K,V>) => void, thisArg?: any): void;
-  
+  forEach(
+    callbackFn: (v: V, k: K, map: IMapSource<K, V>) => void,
+    thisArg?: any,
+  ): void;
+
   /** Returns an iterator that provides all key-value pairs from the collection (as arrays of length 2). */
-  entries(): IterableIterator<[K,V]>;
+  entries(): IterableIterator<[K, V]>;
   /** Returns a new iterator for iterating the keys of each pair. */
   keys(): IterableIterator<K>;
   /** Returns a new iterator for iterating the values of each pair. */
@@ -65,14 +65,13 @@ export interface IMapSource<K=any, V=any> extends ISetSource<K>
   //[Symbol.iterator](): IterableIterator<[K,V]>;
 }
 
-/** Write-only set interface (the set cannot be queried, but items can be added to it.) 
+/** Write-only set interface (the set cannot be queried, but items can be added to it.)
  *  @description Note: BTree<K,V> does not officially implement this interface,
  *               but BTree<K> can be used as an instance of ISetSink<K>. */
-export interface ISetSink<K=any>
-{
+export interface ISetSink<K = any> {
   /** Adds the specified item to the set, if it was not in the set already. */
   add(key: K): any;
-  /** Returns true if an element in the map object existed and has been 
+  /** Returns true if an element in the map object existed and has been
    *  removed, or false if the element did not exist. */
   delete(key: K): boolean;
   /** Removes everything so that the set is empty. */
@@ -80,12 +79,11 @@ export interface ISetSink<K=any>
 }
 
 /** Write-only map interface (i.e. a drain into which key-value pairs can be "sunk") */
-export interface IMapSink<K=any, V=any>
-{
-  /** Returns true if an element in the map object existed and has been 
+export interface IMapSink<K = any, V = any> {
+  /** Returns true if an element in the map object existed and has been
    *  removed, or false if the element did not exist. */
   delete(key: K): boolean;
-  /** Sets the value for the key in the map object (the return value is 
+  /** Sets the value for the key in the map object (the return value is
    *  boolean in BTree but Map returns the Map itself.) */
   set(key: K, value: V): any;
   /** Removes all key/value pairs from the IMap object. */
@@ -95,119 +93,154 @@ export interface IMapSink<K=any, V=any>
 /** Set interface.
  *  @description Note: BTree<K,V> does not officially implement this interface,
  *               but BTree<K> can be used as an instance of ISet<K>. */
-export interface ISet<K=any> extends ISetSource<K>, ISetSink<K> { }
+export interface ISet<K = any> extends ISetSource<K>, ISetSink<K> {}
 
 /** An interface compatible with ES6 Map and BTree. This interface does not
- *  describe the complete interface of either class, but merely the common 
+ *  describe the complete interface of either class, but merely the common
  *  interface shared by both. */
-export interface IMap<K=any, V=any> extends IMapSource<K, V>, IMapSink<K, V> { }
+export interface IMap<K = any, V = any>
+  extends IMapSource<K, V>,
+    IMapSink<K, V> {}
 
 /** An data source that provides read-only access to a set of items called
  *  "keys" in sorted order. This is a subinterface of ISortedMapSource. */
-export interface ISortedSetSource<K=any> extends ISetSource<K>
-{
+export interface ISortedSetSource<K = any> extends ISetSource<K> {
   /** Gets the lowest key in the collection. */
   minKey(): K | undefined;
   /** Gets the highest key in the collection. */
   maxKey(): K | undefined;
   /** Returns the next key larger than the specified key (or undefined if there is none) */
-  nextHigherKey(key: K): K|undefined;
+  nextHigherKey(key: K): K | undefined;
   /** Returns the next key smaller than the specified key (or undefined if there is none) */
-  nextLowerKey(key: K): K|undefined;
+  nextLowerKey(key: K): K | undefined;
   /** Calls `callback` on the specified range of keys, in ascending order by key.
    * @param low The first key scanned will be greater than or equal to `low`.
    * @param high Scanning stops when a key larger than this is reached.
-   * @param includeHigh If the `high` key is present in the map, `onFound` is called 
+   * @param includeHigh If the `high` key is present in the map, `onFound` is called
    *        for that final pair if and only if this parameter is true.
    * @param onFound A function that is called for each key pair. Because this
-   *        is a subinterface of ISortedMapSource, if there is a value 
+   *        is a subinterface of ISortedMapSource, if there is a value
    *        associated with the key, it is passed as the second parameter.
-   * @param initialCounter Initial third argument of `onFound`. This value 
+   * @param initialCounter Initial third argument of `onFound`. This value
    *        increases by one each time `onFound` is called. Default: 0
    * @returns Number of pairs found and the number of times `onFound` was called.
    */
-  forRange(low: K, high: K, includeHigh: boolean, onFound?: (k:K,v:any,counter:number) => void, initialCounter?: number): number;
-  /** Returns a new iterator for iterating the keys of each pair in ascending order. 
+  forRange(
+    low: K,
+    high: K,
+    includeHigh: boolean,
+    onFound?: (k: K, v: any, counter: number) => void,
+    initialCounter?: number,
+  ): number;
+  /** Returns a new iterator for iterating the keys of each pair in ascending order.
    *  @param firstKey: Minimum key to include in the output. */
   keys(firstKey?: K): IterableIterator<K>;
 }
 
 /** An data source that provides read-only access to items in sorted order. */
-export interface ISortedMapSource<K=any, V=any> extends IMapSource<K, V>, ISortedSetSource<K>
-{
+export interface ISortedMapSource<K = any, V = any>
+  extends IMapSource<K, V>,
+    ISortedSetSource<K> {
   /** Returns the next pair whose key is larger than the specified key (or undefined if there is none) */
-  nextHigherPair(key: K): [K,V]|undefined;
+  nextHigherPair(key: K): [K, V] | undefined;
   /** Returns the next pair whose key is smaller than the specified key (or undefined if there is none) */
-  nextLowerPair(key: K): [K,V]|undefined;
+  nextLowerPair(key: K): [K, V] | undefined;
   /** Builds an array of pairs from the specified range of keys, sorted by key.
    * Each returned pair is also an array: pair[0] is the key, pair[1] is the value.
    * @param low The first key in the array will be greater than or equal to `low`.
    * @param high This method returns when a key larger than this is reached.
    * @param includeHigh If the `high` key is present in the map, its pair will be
-   *        included in the output if and only if this parameter is true. Note: 
+   *        included in the output if and only if this parameter is true. Note:
    *        if the `low` key is present, it is always included in the output.
    * @param maxLength Maximum length of the returned array (default: unlimited)
    * @description Computational complexity: O(result.length + log size)
    */
-  getRange(low: K, high: K, includeHigh?: boolean, maxLength?: number): [K,V][];
+  getRange(
+    low: K,
+    high: K,
+    includeHigh?: boolean,
+    maxLength?: number,
+  ): [K, V][];
   /** Calls `callback` on the specified range of keys, in ascending order by key.
    * @param low The first key scanned will be greater than or equal to `low`.
    * @param high Scanning stops when a key larger than this is reached.
-   * @param includeHigh If the `high` key is present in the map, `onFound` is called 
+   * @param includeHigh If the `high` key is present in the map, `onFound` is called
    *        for that final pair if and only if this parameter is true.
    * @param onFound A function that is called for each key-value pair.
-   * @param initialCounter Initial third argument of onFound. This value 
+   * @param initialCounter Initial third argument of onFound. This value
    *        increases by one each time `onFound` is called. Default: 0
    * @returns Number of pairs found and the number of times `callback` was called.
    */
-  forRange(low: K, high: K, includeHigh: boolean, onFound?: (k:K,v:V,counter:number) => void, initialCounter?: number): number;
+  forRange(
+    low: K,
+    high: K,
+    includeHigh: boolean,
+    onFound?: (k: K, v: V, counter: number) => void,
+    initialCounter?: number,
+  ): number;
   /** Returns an iterator that provides items in order by key.
    *  @param firstKey: Minimum key to include in the output. */
-  entries(firstKey?: K): IterableIterator<[K,V]>;
-  /** Returns a new iterator for iterating the keys of each pair in ascending order. 
+  entries(firstKey?: K): IterableIterator<[K, V]>;
+  /** Returns a new iterator for iterating the keys of each pair in ascending order.
    *  @param firstKey: Minimum key to include in the output. */
   keys(firstKey?: K): IterableIterator<K>;
-  /** Returns a new iterator for iterating the values of each pair in order by key. 
+  /** Returns a new iterator for iterating the values of each pair in order by key.
    *  @param firstKey: Minimum key whose associated value is included in the output. */
   values(firstKey?: K): IterableIterator<V>;
-  
+
   // This method should logically be in IMapSource but is not supported by ES6 Map
-  /** Performs a reduce operation like the `reduce` method of `Array`. 
+  /** Performs a reduce operation like the `reduce` method of `Array`.
    *  It is used to combine all pairs into a single value, or perform conversions. */
-  reduce<R>(callback: (previous:R,currentPair:[K,V],counter:number,tree:IMapF<K,V>) => R, initialValue: R): R;
-  /** Performs a reduce operation like the `reduce` method of `Array`. 
+  reduce<R>(
+    callback: (
+      previous: R,
+      currentPair: [K, V],
+      counter: number,
+      tree: IMapF<K, V>,
+    ) => R,
+    initialValue: R,
+  ): R;
+  /** Performs a reduce operation like the `reduce` method of `Array`.
    *  It is used to combine all pairs into a single value, or perform conversions. */
-  reduce<R>(callback: (previous:R|undefined,currentPair:[K,V],counter:number,tree:IMapF<K,V>) => R): R|undefined;
+  reduce<R>(
+    callback: (
+      previous: R | undefined,
+      currentPair: [K, V],
+      counter: number,
+      tree: IMapF<K, V>,
+    ) => R,
+  ): R | undefined;
 }
 
 /** An interface for a set of keys (the combination of ISortedSetSource<K> and ISetSink<K>) */
-export interface ISortedSet<K=any> extends ISortedSetSource<K>, ISetSink<K> { }
+export interface ISortedSet<K = any> extends ISortedSetSource<K>, ISetSink<K> {}
 
-/** An interface for a sorted map (dictionary), 
+/** An interface for a sorted map (dictionary),
  *  not including functional/persistent methods. */
-export interface ISortedMap<K=any, V=any> extends IMap<K,V>, ISortedMapSource<K, V>
-{
+export interface ISortedMap<K = any, V = any>
+  extends IMap<K, V>,
+    ISortedMapSource<K, V> {
   // All of the following methods should be in IMap but are left out of IMap
   // so that IMap is compatible with ES6 Map.
 
   /** Adds or overwrites a key-value pair in the sorted map.
    * @param key the key is used to determine the sort order of data in the tree.
    * @param value data to associate with the key
-   * @param overwrite Whether to overwrite an existing key-value pair 
+   * @param overwrite Whether to overwrite an existing key-value pair
    *        (default: true). If this is false and there is an existing
    *        key-value pair then the call to this method has no effect.
-   * @returns true if a new key-value pair was added, false if the key 
+   * @returns true if a new key-value pair was added, false if the key
    *        already existed. */
   set(key: K, value: V, overwrite?: boolean): boolean;
   /** Adds all pairs from a list of key-value pairs.
-   * @param pairs Pairs to add to this tree. If there are duplicate keys, 
-   *        later pairs currently overwrite earlier ones (e.g. [[0,1],[0,7]] 
+   * @param pairs Pairs to add to this tree. If there are duplicate keys,
+   *        later pairs currently overwrite earlier ones (e.g. [[0,1],[0,7]]
    *        associates 0 with 7.)
    * @param overwrite Whether to overwrite pairs that already exist (if false,
    *        pairs[i] is ignored when the key pairs[i][0] already exists.)
    * @returns The number of pairs added to the collection.
    */
-  setPairs(pairs: [K,V][], overwrite?: boolean): number;
+  setPairs(pairs: [K, V][], overwrite?: boolean): number;
   /** Deletes a series of keys from the collection. */
   deleteKeys(keys: K[]): number;
   /** Removes a range of key-value pairs from the B+ tree.
@@ -218,18 +251,18 @@ export interface ISortedMap<K=any, V=any> extends IMap<K,V>, ISortedMapSource<K,
   deleteRange(low: K, high: K, includeHigh: boolean): number;
 
   // TypeScript requires these methods of ISortedMapSource to be repeated
-  entries(firstKey?: K): IterableIterator<[K,V]>;
+  entries(firstKey?: K): IterableIterator<[K, V]>;
   keys(firstKey?: K): IterableIterator<K>;
   values(firstKey?: K): IterableIterator<V>;
 }
 
-/** An interface for a functional set, in which the set object could be read-only 
- *  but new versions of the set can be created by calling "with" or "without" 
+/** An interface for a functional set, in which the set object could be read-only
+ *  but new versions of the set can be created by calling "with" or "without"
  *  methods to add or remove keys. This is a subinterface of IMapF<K,V>,
  *  so the items in the set may be referred to as "keys". */
-export interface ISetF<K=any> extends ISetSource<K> {
-  /** Returns a copy of the set with the specified key included. 
-   *  @description You might wonder why this method accepts only one key 
+export interface ISetF<K = any> extends ISetSource<K> {
+  /** Returns a copy of the set with the specified key included.
+   *  @description You might wonder why this method accepts only one key
    *  instead of `...keys: K[]`. The reason is that the derived interface
    *  IMapF expects the second parameter to be a value. Therefore
    *  withKeys() is provided to set multiple keys at once. */
@@ -239,91 +272,133 @@ export interface ISetF<K=any> extends ISetSource<K> {
   /** Returns a copy of the tree with all the keys in the specified array present.
    *  @param keys The keys to add.
    *  @param returnThisIfUnchanged If true, the method returns `this` when
-   *         all of the keys are already present in the collection. The 
+   *         all of the keys are already present in the collection. The
    *         default value may be true or false depending on the concrete
    *         implementation of the interface (in BTree, the default is false.) */
   withKeys(keys: K[], returnThisIfUnchanged?: boolean): ISetF<K>;
   /** Returns a copy of the tree with all the keys in the specified array removed. */
   withoutKeys(keys: K[], returnThisIfUnchanged?: boolean): ISetF<K>;
-  /** Returns a copy of the tree with items removed whenever the callback 
+  /** Returns a copy of the tree with items removed whenever the callback
    *  function returns false.
    *  @param callback A function to call for each item in the set.
    *         The second parameter to `callback` exists because ISetF
    *         is a subinterface of IMapF. If the object is a map, v
    *         is the value associated with the key, otherwise v could be
    *         undefined or another copy of the third parameter (counter). */
-  filter(callback: (k:K,v:any,counter:number) => boolean, returnThisIfUnchanged?: boolean): ISetF<K>;
+  filter(
+    callback: (k: K, v: any, counter: number) => boolean,
+    returnThisIfUnchanged?: boolean,
+  ): ISetF<K>;
 }
 
 /** An interface for a functional map, in which the map object could be read-only
- *  but new versions of the map can be created by calling "with" or "without" 
- *  methods to add or remove keys or key-value pairs. 
+ *  but new versions of the map can be created by calling "with" or "without"
+ *  methods to add or remove keys or key-value pairs.
  */
-export interface IMapF<K=any, V=any> extends IMapSource<K, V>, ISetF<K> {
+export interface IMapF<K = any, V = any> extends IMapSource<K, V>, ISetF<K> {
   /** Returns a copy of the tree with the specified key set (the value is undefined). */
-  with(key: K): IMapF<K,V|undefined>;
+  with(key: K): IMapF<K, V | undefined>;
   /** Returns a copy of the tree with the specified key-value pair set. */
-  with<V2>(key: K, value: V2, overwrite?: boolean): IMapF<K,V|V2>;
+  with<V2>(key: K, value: V2, overwrite?: boolean): IMapF<K, V | V2>;
   /** Returns a copy of the tree with the specified key-value pairs set. */
-  withPairs<V2>(pairs: [K,V|V2][], overwrite: boolean): IMapF<K,V|V2>;
+  withPairs<V2>(pairs: [K, V | V2][], overwrite: boolean): IMapF<K, V | V2>;
   /** Returns a copy of the tree with all the keys in the specified array present.
    *  @param keys The keys to add. If a key is already present in the tree,
-   *         neither the existing key nor the existing value is modified. 
+   *         neither the existing key nor the existing value is modified.
    *  @param returnThisIfUnchanged If true, the method returns `this` when
-   *         all of the keys are already present in the collection. The 
+   *         all of the keys are already present in the collection. The
    *         default value may be true or false depending on the concrete
    *         implementation of the interface (in BTree, the default is false.) */
-  withKeys(keys: K[], returnThisIfUnchanged?: boolean): IMapF<K,V|undefined>;
+  withKeys(keys: K[], returnThisIfUnchanged?: boolean): IMapF<K, V | undefined>;
   /** Returns a copy of the tree with all values altered by a callback function. */
-  mapValues<R>(callback: (v:V,k:K,counter:number) => R): IMapF<K,R>;
-  /** Performs a reduce operation like the `reduce` method of `Array`. 
+  mapValues<R>(callback: (v: V, k: K, counter: number) => R): IMapF<K, R>;
+  /** Performs a reduce operation like the `reduce` method of `Array`.
    *  It is used to combine all pairs into a single value, or perform conversions. */
-  reduce<R>(callback: (previous:R,currentPair:[K,V],counter:number,tree:IMapF<K,V>) => R, initialValue: R): R;
-  /** Performs a reduce operation like the `reduce` method of `Array`. 
+  reduce<R>(
+    callback: (
+      previous: R,
+      currentPair: [K, V],
+      counter: number,
+      tree: IMapF<K, V>,
+    ) => R,
+    initialValue: R,
+  ): R;
+  /** Performs a reduce operation like the `reduce` method of `Array`.
    *  It is used to combine all pairs into a single value, or perform conversions. */
-  reduce<R>(callback: (previous:R|undefined,currentPair:[K,V],counter:number,tree:IMapF<K,V>) => R): R|undefined;
+  reduce<R>(
+    callback: (
+      previous: R | undefined,
+      currentPair: [K, V],
+      counter: number,
+      tree: IMapF<K, V>,
+    ) => R,
+  ): R | undefined;
 
   // Update return types in ISetF
-  without(key: K): IMapF<K,V>;
-  withoutKeys(keys: K[], returnThisIfUnchanged?: boolean): IMapF<K,V>;
-  /** Returns a copy of the tree with pairs removed whenever the callback 
+  without(key: K): IMapF<K, V>;
+  withoutKeys(keys: K[], returnThisIfUnchanged?: boolean): IMapF<K, V>;
+  /** Returns a copy of the tree with pairs removed whenever the callback
    *  function returns false. */
-  filter(callback: (k:K,v:V,counter:number) => boolean, returnThisIfUnchanged?: boolean): IMapF<K,V>;
+  filter(
+    callback: (k: K, v: V, counter: number) => boolean,
+    returnThisIfUnchanged?: boolean,
+  ): IMapF<K, V>;
 }
 
-/** An interface for a functional sorted set: a functional set in which the 
+/** An interface for a functional sorted set: a functional set in which the
  *  keys (items) are sorted. This is a subinterface of ISortedMapF. */
-export interface ISortedSetF<K=any> extends ISetF<K>, ISortedSetSource<K>
-{
+export interface ISortedSetF<K = any> extends ISetF<K>, ISortedSetSource<K> {
   // TypeScript requires this method of ISortedSetSource to be repeated
   keys(firstKey?: K): IterableIterator<K>;
 }
 
-export interface ISortedMapF<K=any,V=any> extends ISortedSetF<K>, IMapF<K,V>, ISortedMapSource<K,V>
-{
+export interface ISortedMapF<K = any, V = any>
+  extends ISortedSetF<K>,
+    IMapF<K, V>,
+    ISortedMapSource<K, V> {
   /** Returns a copy of the tree with the specified range of keys removed. */
-  withoutRange(low: K, high: K, includeHigh: boolean, returnThisIfUnchanged?: boolean): ISortedMapF<K,V>;
+  withoutRange(
+    low: K,
+    high: K,
+    includeHigh: boolean,
+    returnThisIfUnchanged?: boolean,
+  ): ISortedMapF<K, V>;
 
   // TypeScript requires these methods of ISortedSetF and ISortedMapSource to be repeated
-  entries(firstKey?: K): IterableIterator<[K,V]>;
+  entries(firstKey?: K): IterableIterator<[K, V]>;
   keys(firstKey?: K): IterableIterator<K>;
   values(firstKey?: K): IterableIterator<V>;
-  forRange(low: K, high: K, includeHigh: boolean, onFound?: (k:K,v:V,counter:number) => void, initialCounter?: number): number;
+  forRange(
+    low: K,
+    high: K,
+    includeHigh: boolean,
+    onFound?: (k: K, v: V, counter: number) => void,
+    initialCounter?: number,
+  ): number;
 
   // Update the return value of methods from base interfaces
-  with(key: K): ISortedMapF<K,V|undefined>;
-  with<V2>(key: K, value: V2, overwrite?: boolean): ISortedMapF<K,V|V2>;
-  withKeys(keys: K[], returnThisIfUnchanged?: boolean): ISortedMapF<K,V|undefined>;
-  withPairs<V2>(pairs: [K,V|V2][], overwrite: boolean): ISortedMapF<K,V|V2>;
-  mapValues<R>(callback: (v:V,k:K,counter:number) => R): ISortedMapF<K,R>;
-  without(key: K): ISortedMapF<K,V>;
-  withoutKeys(keys: K[], returnThisIfUnchanged?: boolean): ISortedMapF<K,V>;
-  filter(callback: (k:K,v:any,counter:number) => boolean, returnThisIfUnchanged?: boolean): ISortedMapF<K,V>;
+  with(key: K): ISortedMapF<K, V | undefined>;
+  with<V2>(key: K, value: V2, overwrite?: boolean): ISortedMapF<K, V | V2>;
+  withKeys(
+    keys: K[],
+    returnThisIfUnchanged?: boolean,
+  ): ISortedMapF<K, V | undefined>;
+  withPairs<V2>(
+    pairs: [K, V | V2][],
+    overwrite: boolean,
+  ): ISortedMapF<K, V | V2>;
+  mapValues<R>(callback: (v: V, k: K, counter: number) => R): ISortedMapF<K, R>;
+  without(key: K): ISortedMapF<K, V>;
+  withoutKeys(keys: K[], returnThisIfUnchanged?: boolean): ISortedMapF<K, V>;
+  filter(
+    callback: (k: K, v: any, counter: number) => boolean,
+    returnThisIfUnchanged?: boolean,
+  ): ISortedMapF<K, V>;
 }
 
-export interface ISortedMapConstructor<K,V> {
-    new (entries?: [K,V][], compare?: (a: K, b: K) => number): ISortedMap<K,V>;
+export interface ISortedMapConstructor<K, V> {
+  new (entries?: [K, V][], compare?: (a: K, b: K) => number): ISortedMap<K, V>;
+}
+export interface ISortedMapFConstructor<K, V> {
+  new (entries?: [K, V][], compare?: (a: K, b: K) => number): ISortedMapF<K, V>;
 }
-export interface ISortedMapFConstructor<K,V> {
-    new (entries?: [K,V][], compare?: (a: K, b: K) => number): ISortedMapF<K,V>;
-}
\ No newline at end of file
diff --git a/packages/idb-bridge/src/util/FakeEvent.ts b/packages/idb-bridge/src/util/FakeEvent.ts
index ae62401c3..4457498f6 100644
--- a/packages/idb-bridge/src/util/FakeEvent.ts
+++ b/packages/idb-bridge/src/util/FakeEvent.ts
@@ -14,67 +14,64 @@
  permissions and limitations under the License.
 */
 
-
 import FakeEventTarget from "./FakeEventTarget";
 import { EventType } from "./types";
 
 export class Event {
-    public eventPath: FakeEventTarget[] = [];
-    public type: EventType;
-
-    public readonly NONE = 0;
-    public readonly CAPTURING_PHASE = 1;
-    public readonly AT_TARGET = 2;
-    public readonly BUBBLING_PHASE = 3;
-
-    // Flags
-    public propagationStopped = false;
-    public immediatePropagationStopped = false;
-    public canceled = false;
-    public initialized = true;
-    public dispatched = false;
-
-    public target: FakeEventTarget | null = null;
-    public currentTarget: FakeEventTarget | null = null;
-
-    public eventPhase: 0 | 1 | 2 | 3 = 0;
-
-    public defaultPrevented = false;
-
-    public isTrusted = false;
-    public timeStamp = Date.now();
-
-    public bubbles: boolean;
-    public cancelable: boolean;
-
-    constructor(
-        type: EventType,
-        eventInitDict: { bubbles?: boolean; cancelable?: boolean } = {},
-    ) {
-        this.type = type;
-
-        this.bubbles =
-            eventInitDict.bubbles !== undefined ? eventInitDict.bubbles : false;
-        this.cancelable =
-            eventInitDict.cancelable !== undefined
-                ? eventInitDict.cancelable
-                : false;
-    }
+  public eventPath: FakeEventTarget[] = [];
+  public type: EventType;
 
-    public preventDefault() {
-        if (this.cancelable) {
-            this.canceled = true;
-        }
-    }
+  public readonly NONE = 0;
+  public readonly CAPTURING_PHASE = 1;
+  public readonly AT_TARGET = 2;
+  public readonly BUBBLING_PHASE = 3;
 
-    public stopPropagation() {
-        this.propagationStopped = true;
-    }
+  // Flags
+  public propagationStopped = false;
+  public immediatePropagationStopped = false;
+  public canceled = false;
+  public initialized = true;
+  public dispatched = false;
+
+  public target: FakeEventTarget | null = null;
+  public currentTarget: FakeEventTarget | null = null;
+
+  public eventPhase: 0 | 1 | 2 | 3 = 0;
+
+  public defaultPrevented = false;
 
-    public stopImmediatePropagation() {
-        this.propagationStopped = true;
-        this.immediatePropagationStopped = true;
+  public isTrusted = false;
+  public timeStamp = Date.now();
+
+  public bubbles: boolean;
+  public cancelable: boolean;
+
+  constructor(
+    type: EventType,
+    eventInitDict: { bubbles?: boolean; cancelable?: boolean } = {},
+  ) {
+    this.type = type;
+
+    this.bubbles =
+      eventInitDict.bubbles !== undefined ? eventInitDict.bubbles : false;
+    this.cancelable =
+      eventInitDict.cancelable !== undefined ? eventInitDict.cancelable : false;
+  }
+
+  public preventDefault() {
+    if (this.cancelable) {
+      this.canceled = true;
     }
+  }
+
+  public stopPropagation() {
+    this.propagationStopped = true;
+  }
+
+  public stopImmediatePropagation() {
+    this.propagationStopped = true;
+    this.immediatePropagationStopped = true;
+  }
 }
 
 export default Event;
diff --git a/packages/idb-bridge/src/util/FakeEventTarget.ts b/packages/idb-bridge/src/util/FakeEventTarget.ts
index 025f21b4c..291eaca7d 100644
--- a/packages/idb-bridge/src/util/FakeEventTarget.ts
+++ b/packages/idb-bridge/src/util/FakeEventTarget.ts
@@ -117,7 +117,7 @@ abstract class FakeEventTarget {
     callback: EventCallback,
     capture = false,
   ) {
-    const i = this.listeners.findIndex(listener => {
+    const i = this.listeners.findIndex((listener) => {
       return (
         listener.type === type &&
         listener.callback === callback &&
diff --git a/packages/idb-bridge/src/util/cmp.ts b/packages/idb-bridge/src/util/cmp.ts
index 9d0dc99a2..ddd43f2a6 100644
--- a/packages/idb-bridge/src/util/cmp.ts
+++ b/packages/idb-bridge/src/util/cmp.ts
@@ -18,91 +18,91 @@ import { DataError } from "./errors";
 import valueToKey from "./valueToKey";
 
 const getType = (x: any) => {
-    if (typeof x === "number") {
-        return "Number";
-    }
-    if (x instanceof Date) {
-        return "Date";
-    }
-    if (Array.isArray(x)) {
-        return "Array";
-    }
-    if (typeof x === "string") {
-        return "String";
-    }
-    if (x instanceof ArrayBuffer) {
-        return "Binary";
-    }
-
-    throw new DataError();
+  if (typeof x === "number") {
+    return "Number";
+  }
+  if (x instanceof Date) {
+    return "Date";
+  }
+  if (Array.isArray(x)) {
+    return "Array";
+  }
+  if (typeof x === "string") {
+    return "String";
+  }
+  if (x instanceof ArrayBuffer) {
+    return "Binary";
+  }
+
+  throw new DataError();
 };
 
 // https://w3c.github.io/IndexedDB/#compare-two-keys
 const compareKeys = (first: any, second: any): -1 | 0 | 1 => {
-    if (second === undefined) {
-        throw new TypeError();
-    }
+  if (second === undefined) {
+    throw new TypeError();
+  }
 
-    first = valueToKey(first);
-    second = valueToKey(second);
-
-    const t1 = getType(first);
-    const t2 = getType(second);
-
-    if (t1 !== t2) {
-        if (t1 === "Array") {
-            return 1;
-        }
-        if (
-            t1 === "Binary" &&
-            (t2 === "String" || t2 === "Date" || t2 === "Number")
-        ) {
-            return 1;
-        }
-        if (t1 === "String" && (t2 === "Date" || t2 === "Number")) {
-            return 1;
-        }
-        if (t1 === "Date" && t2 === "Number") {
-            return 1;
-        }
-        return -1;
-    }
+  first = valueToKey(first);
+  second = valueToKey(second);
 
-    if (t1 === "Binary") {
-        first = new Uint8Array(first);
-        second = new Uint8Array(second);
+  const t1 = getType(first);
+  const t2 = getType(second);
+
+  if (t1 !== t2) {
+    if (t1 === "Array") {
+      return 1;
+    }
+    if (
+      t1 === "Binary" &&
+      (t2 === "String" || t2 === "Date" || t2 === "Number")
+    ) {
+      return 1;
+    }
+    if (t1 === "String" && (t2 === "Date" || t2 === "Number")) {
+      return 1;
+    }
+    if (t1 === "Date" && t2 === "Number") {
+      return 1;
+    }
+    return -1;
+  }
+
+  if (t1 === "Binary") {
+    first = new Uint8Array(first);
+    second = new Uint8Array(second);
+  }
+
+  if (t1 === "Array" || t1 === "Binary") {
+    const length = Math.min(first.length, second.length);
+    for (let i = 0; i < length; i++) {
+      const result = compareKeys(first[i], second[i]);
+
+      if (result !== 0) {
+        return result;
+      }
     }
 
-    if (t1 === "Array" || t1 === "Binary") {
-        const length = Math.min(first.length, second.length);
-        for (let i = 0; i < length; i++) {
-            const result = compareKeys(first[i], second[i]);
-
-            if (result !== 0) {
-                return result;
-            }
-        }
-
-        if (first.length > second.length) {
-            return 1;
-        }
-        if (first.length < second.length) {
-            return -1;
-        }
-        return 0;
+    if (first.length > second.length) {
+      return 1;
+    }
+    if (first.length < second.length) {
+      return -1;
     }
+    return 0;
+  }
 
-    if (t1 === "Date") {
-        if (first.getTime() === second.getTime()) {
-            return 0;
-        }
-    } else {
-        if (first === second) {
-            return 0;
-        }
+  if (t1 === "Date") {
+    if (first.getTime() === second.getTime()) {
+      return 0;
+    }
+  } else {
+    if (first === second) {
+      return 0;
     }
+  }
 
-    return first > second ? 1 : -1;
+  return first > second ? 1 : -1;
 };
 
 export default compareKeys;
diff --git a/packages/idb-bridge/src/util/enforceRange.ts b/packages/idb-bridge/src/util/enforceRange.ts
index 9ac472757..87e135798 100644
--- a/packages/idb-bridge/src/util/enforceRange.ts
+++ b/packages/idb-bridge/src/util/enforceRange.ts
@@ -18,18 +18,18 @@
 // https://heycam.github.io/webidl/#EnforceRange
 
 const enforceRange = (
-    num: number,
-    type: "MAX_SAFE_INTEGER" | "unsigned long",
+  num: number,
+  type: "MAX_SAFE_INTEGER" | "unsigned long",
 ) => {
-    const min = 0;
-    const max = type === "unsigned long" ? 4294967295 : 9007199254740991;
+  const min = 0;
+  const max = type === "unsigned long" ? 4294967295 : 9007199254740991;
 
-    if (isNaN(num) || num < min || num > max) {
-        throw new TypeError();
-    }
-    if (num >= 0) {
-        return Math.floor(num);
-    }
+  if (isNaN(num) || num < min || num > max) {
+    throw new TypeError();
+  }
+  if (num >= 0) {
+    return Math.floor(num);
+  }
 };
 
 export default enforceRange;
diff --git a/packages/idb-bridge/src/util/errors.ts b/packages/idb-bridge/src/util/errors.ts
index 92de2ea90..6c8f81811 100644
--- a/packages/idb-bridge/src/util/errors.ts
+++ b/packages/idb-bridge/src/util/errors.ts
@@ -14,117 +14,116 @@
  permissions and limitations under the License.
  */
 
-
 /* tslint:disable: max-classes-per-file max-line-length */
 
 const messages = {
-    AbortError:
-        "A request was aborted, for example through a call to IDBTransaction.abort.",
-    ConstraintError:
-        "A mutation operation in the transaction failed because a constraint was not satisfied. For example, an object such as an object store or index already exists and a request attempted to create a new one.",
-    DataCloneError:
-        "The data being stored could not be cloned by the internal structured cloning algorithm.",
-    DataError: "Data provided to an operation does not meet requirements.",
-    InvalidAccessError:
-        "An invalid operation was performed on an object. For example transaction creation attempt was made, but an empty scope was provided.",
-    InvalidStateError:
-        "An operation was called on an object on which it is not allowed or at a time when it is not allowed. Also occurs if a request is made on a source object that has been deleted or removed. Use TransactionInactiveError or ReadOnlyError when possible, as they are more specific variations of InvalidStateError.",
-    NotFoundError:
-        "The operation failed because the requested database object could not be found. For example, an object store did not exist but was being opened.",
-    ReadOnlyError:
-        'The mutating operation was attempted in a "readonly" transaction.',
-    TransactionInactiveError:
-        "A request was placed against a transaction which is currently not active, or which is finished.",
-    VersionError:
-        "An attempt was made to open a database using a lower version than the existing version.",
+  AbortError:
+    "A request was aborted, for example through a call to IDBTransaction.abort.",
+  ConstraintError:
+    "A mutation operation in the transaction failed because a constraint was not satisfied. For example, an object such as an object store or index already exists and a request attempted to create a new one.",
+  DataCloneError:
+    "The data being stored could not be cloned by the internal structured cloning algorithm.",
+  DataError: "Data provided to an operation does not meet requirements.",
+  InvalidAccessError:
+    "An invalid operation was performed on an object. For example transaction creation attempt was made, but an empty scope was provided.",
+  InvalidStateError:
+    "An operation was called on an object on which it is not allowed or at a time when it is not allowed. Also occurs if a request is made on a source object that has been deleted or removed. Use TransactionInactiveError or ReadOnlyError when possible, as they are more specific variations of InvalidStateError.",
+  NotFoundError:
+    "The operation failed because the requested database object could not be found. For example, an object store did not exist but was being opened.",
+  ReadOnlyError:
+    'The mutating operation was attempted in a "readonly" transaction.',
+  TransactionInactiveError:
+    "A request was placed against a transaction which is currently not active, or which is finished.",
+  VersionError:
+    "An attempt was made to open a database using a lower version than the existing version.",
 };
 
 export class AbortError extends Error {
-    constructor(message = messages.AbortError) {
-        super();
-        Object.setPrototypeOf(this, ConstraintError.prototype);
-        this.name = "AbortError";
-        this.message = message;
-    }
+  constructor(message = messages.AbortError) {
+    super();
+    Object.setPrototypeOf(this, ConstraintError.prototype);
+    this.name = "AbortError";
+    this.message = message;
+  }
 }
 
 export class ConstraintError extends Error {
-    constructor(message = messages.ConstraintError) {
-        super();
-        Object.setPrototypeOf(this, ConstraintError.prototype);
-        this.name = "ConstraintError";
-        this.message = message;
-    }
+  constructor(message = messages.ConstraintError) {
+    super();
+    Object.setPrototypeOf(this, ConstraintError.prototype);
+    this.name = "ConstraintError";
+    this.message = message;
+  }
 }
 
 export class DataCloneError extends Error {
-    constructor(message = messages.DataCloneError) {
-        super();
-        Object.setPrototypeOf(this, DataCloneError.prototype);
-        this.name = "DataCloneError";
-        this.message = message;
-    }
+  constructor(message = messages.DataCloneError) {
+    super();
+    Object.setPrototypeOf(this, DataCloneError.prototype);
+    this.name = "DataCloneError";
+    this.message = message;
+  }
 }
 
 export class DataError extends Error {
-    constructor(message = messages.DataError) {
-        super();
-        Object.setPrototypeOf(this, DataError.prototype);
-        this.name = "DataError";
-        this.message = message;
-    }
+  constructor(message = messages.DataError) {
+    super();
+    Object.setPrototypeOf(this, DataError.prototype);
+    this.name = "DataError";
+    this.message = message;
+  }
 }
 
 export class InvalidAccessError extends Error {
-    constructor(message = messages.InvalidAccessError) {
-        super();
-        Object.setPrototypeOf(this, InvalidAccessError.prototype);
-        this.name = "InvalidAccessError";
-        this.message = message;
-    }
+  constructor(message = messages.InvalidAccessError) {
+    super();
+    Object.setPrototypeOf(this, InvalidAccessError.prototype);
+    this.name = "InvalidAccessError";
+    this.message = message;
+  }
 }
 
 export class InvalidStateError extends Error {
-    constructor(message = messages.InvalidStateError) {
-        super();
-        Object.setPrototypeOf(this, InvalidStateError.prototype);
-        this.name = "InvalidStateError";
-        this.message = message;
-    }
+  constructor(message = messages.InvalidStateError) {
+    super();
+    Object.setPrototypeOf(this, InvalidStateError.prototype);
+    this.name = "InvalidStateError";
+    this.message = message;
+  }
 }
 
 export class NotFoundError extends Error {
-    constructor(message = messages.NotFoundError) {
-        super();
-        Object.setPrototypeOf(this, NotFoundError.prototype);
-        this.name = "NotFoundError";
-        this.message = message;
-    }
+  constructor(message = messages.NotFoundError) {
+    super();
+    Object.setPrototypeOf(this, NotFoundError.prototype);
+    this.name = "NotFoundError";
+    this.message = message;
+  }
 }
 
 export class ReadOnlyError extends Error {
-    constructor(message = messages.ReadOnlyError) {
-        super();
-        Object.setPrototypeOf(this, ReadOnlyError.prototype);
-        this.name = "ReadOnlyError";
-        this.message = message;
-    }
+  constructor(message = messages.ReadOnlyError) {
+    super();
+    Object.setPrototypeOf(this, ReadOnlyError.prototype);
+    this.name = "ReadOnlyError";
+    this.message = message;
+  }
 }
 
 export class TransactionInactiveError extends Error {
-    constructor(message = messages.TransactionInactiveError) {
-        super();
-        Object.setPrototypeOf(this, TransactionInactiveError.prototype);
-        this.name = "TransactionInactiveError";
-        this.message = message;
-    }
+  constructor(message = messages.TransactionInactiveError) {
+    super();
+    Object.setPrototypeOf(this, TransactionInactiveError.prototype);
+    this.name = "TransactionInactiveError";
+    this.message = message;
+  }
 }
 
 export class VersionError extends Error {
-    constructor(message = messages.VersionError) {
-        super();
-        Object.setPrototypeOf(this, VersionError.prototype);
-        this.name = "VersionError";
-        this.message = message;
-    }
+  constructor(message = messages.VersionError) {
+    super();
+    Object.setPrototypeOf(this, VersionError.prototype);
+    this.name = "VersionError";
+    this.message = message;
+  }
 }
diff --git a/packages/idb-bridge/src/util/getIndexKeys.test.ts b/packages/idb-bridge/src/util/getIndexKeys.test.ts
index b9cdc769d..782b3da2f 100644
--- a/packages/idb-bridge/src/util/getIndexKeys.test.ts
+++ b/packages/idb-bridge/src/util/getIndexKeys.test.ts
@@ -19,23 +19,31 @@ import test from "ava";
 import { getIndexKeys } from "./getIndexKeys";
 
 test("basics", (t) => {
-  t.deepEqual(getIndexKeys({foo: 42}, "foo", false), [42]);
-  t.deepEqual(getIndexKeys({foo: {bar: 42}}, "foo.bar", false), [42]);
-  t.deepEqual(getIndexKeys({foo: [42, 43]}, "foo.0", false), [42]);
-  t.deepEqual(getIndexKeys({foo: [42, 43]}, "foo.1", false), [43]);
+  t.deepEqual(getIndexKeys({ foo: 42 }, "foo", false), [42]);
+  t.deepEqual(getIndexKeys({ foo: { bar: 42 } }, "foo.bar", false), [42]);
+  t.deepEqual(getIndexKeys({ foo: [42, 43] }, "foo.0", false), [42]);
+  t.deepEqual(getIndexKeys({ foo: [42, 43] }, "foo.1", false), [43]);
 
   t.deepEqual(getIndexKeys([1, 2, 3], "", false), [[1, 2, 3]]);
 
   t.throws(() => {
-    getIndexKeys({foo: 42}, "foo.bar", false);
+    getIndexKeys({ foo: 42 }, "foo.bar", false);
   });
 
-  t.deepEqual(getIndexKeys({foo: 42}, "foo", true), [42]);
-  t.deepEqual(getIndexKeys({foo: 42, bar: 10}, ["foo", "bar"], true), [42, 10]);
-  t.deepEqual(getIndexKeys({foo: 42, bar: 10}, ["foo", "bar"], false), [[42, 10]]);
-  t.deepEqual(getIndexKeys({foo: 42, bar: 10}, ["foo", "bar", "spam"], true), [42, 10]);
+  t.deepEqual(getIndexKeys({ foo: 42 }, "foo", true), [42]);
+  t.deepEqual(getIndexKeys({ foo: 42, bar: 10 }, ["foo", "bar"], true), [
+    42,
+    10,
+  ]);
+  t.deepEqual(getIndexKeys({ foo: 42, bar: 10 }, ["foo", "bar"], false), [
+    [42, 10],
+  ]);
+  t.deepEqual(
+    getIndexKeys({ foo: 42, bar: 10 }, ["foo", "bar", "spam"], true),
+    [42, 10],
+  );
 
   t.throws(() => {
-    getIndexKeys({foo: 42, bar: 10}, ["foo", "bar", "spam"], false);
+    getIndexKeys({ foo: 42, bar: 10 }, ["foo", "bar", "spam"], false);
   });
 });
diff --git a/packages/idb-bridge/src/util/injectKey.ts b/packages/idb-bridge/src/util/injectKey.ts
index 78d0c217e..38add33bd 100644
--- a/packages/idb-bridge/src/util/injectKey.ts
+++ b/packages/idb-bridge/src/util/injectKey.ts
@@ -62,4 +62,4 @@ export function injectKey(keyPath: KeyPath, value: Value, key: Key): Value {
   return newValue;
 }
 
-export default injectKey;
\ No newline at end of file
+export default injectKey;
diff --git a/packages/idb-bridge/src/util/makeStoreKeyValue.test.ts b/packages/idb-bridge/src/util/makeStoreKeyValue.test.ts
index ecbae6508..df9748316 100644
--- a/packages/idb-bridge/src/util/makeStoreKeyValue.test.ts
+++ b/packages/idb-bridge/src/util/makeStoreKeyValue.test.ts
@@ -14,7 +14,7 @@
  permissions and limitations under the License.
 */
 
-import test from 'ava';
+import test from "ava";
 import { makeStoreKeyValue } from "./makeStoreKeyValue";
 
 test("basics", (t) => {
@@ -26,19 +26,37 @@ test("basics", (t) => {
   t.is(result.value.name, "Florian");
   t.is(result.value.id, 42);
 
-  result = makeStoreKeyValue({ name: "Florian", id: 10 }, undefined, 5, true, "id");
+  result = makeStoreKeyValue(
+    { name: "Florian", id: 10 },
+    undefined,
+    5,
+    true,
+    "id",
+  );
   t.is(result.updatedKeyGenerator, 11);
   t.is(result.key, 10);
   t.is(result.value.name, "Florian");
   t.is(result.value.id, 10);
 
-  result = makeStoreKeyValue({ name: "Florian", id: 5 }, undefined, 10, true, "id");
+  result = makeStoreKeyValue(
+    { name: "Florian", id: 5 },
+    undefined,
+    10,
+    true,
+    "id",
+  );
   t.is(result.updatedKeyGenerator, 10);
   t.is(result.key, 5);
   t.is(result.value.name, "Florian");
   t.is(result.value.id, 5);
 
-  result = makeStoreKeyValue({ name: "Florian", id: "foo" }, undefined, 10, true, "id");
+  result = makeStoreKeyValue(
+    { name: "Florian", id: "foo" },
+    undefined,
+    10,
+    true,
+    "id",
+  );
   t.is(result.updatedKeyGenerator, 10);
   t.is(result.key, "foo");
   t.is(result.value.name, "Florian");
diff --git a/packages/idb-bridge/src/util/makeStoreKeyValue.ts b/packages/idb-bridge/src/util/makeStoreKeyValue.ts
index 9b33158dd..f9006ef51 100644
--- a/packages/idb-bridge/src/util/makeStoreKeyValue.ts
+++ b/packages/idb-bridge/src/util/makeStoreKeyValue.ts
@@ -14,7 +14,6 @@
  permissions and limitations under the License.
 */
 
-
 import { Value, Key, KeyPath } from "./types";
 import extractKey from "./extractKey";
 import { DataError } from "./errors";
@@ -93,7 +92,7 @@ export function makeStoreKeyValue(
           key: key,
           value: value,
           updatedKeyGenerator,
-        }
+        };
       } else {
         // (no, yes, no)
         key = extractKey(keyPath!, value);
@@ -111,7 +110,7 @@ export function makeStoreKeyValue(
           key: currentKeyGenerator,
           value: value,
           updatedKeyGenerator: currentKeyGenerator + 1,
-        }
+        };
       } else {
         // (no, no, no)
         throw new DataError();
diff --git a/packages/idb-bridge/src/util/queueTask.ts b/packages/idb-bridge/src/util/queueTask.ts
index 7d59c2263..53563ffd2 100644
--- a/packages/idb-bridge/src/util/queueTask.ts
+++ b/packages/idb-bridge/src/util/queueTask.ts
@@ -14,8 +14,8 @@
   permissions and limitations under the License.
  */
 
- export function queueTask(fn: () => void) {
-   setImmediate(fn);
- }
+export function queueTask(fn: () => void) {
+  setImmediate(fn);
+}
 
- export default queueTask;
\ No newline at end of file
+export default queueTask;
diff --git a/packages/idb-bridge/src/util/structuredClone.ts b/packages/idb-bridge/src/util/structuredClone.ts
index 165ed2f32..c49d0377f 100644
--- a/packages/idb-bridge/src/util/structuredClone.ts
+++ b/packages/idb-bridge/src/util/structuredClone.ts
@@ -14,7 +14,6 @@
  permissions and limitations under the License.
 */
 
-
 function structuredCloneImpl(val: any, visited: WeakMap<any, boolean>): any {
   // FIXME: replace with real implementation!
   return JSON.parse(JSON.stringify(val));
@@ -28,4 +27,4 @@ export function structuredClone(val: any): any {
   return structuredCloneImpl(val, visited);
 }
 
-export default structuredClone;
\ No newline at end of file
+export default structuredClone;
diff --git a/packages/idb-bridge/src/util/types.ts b/packages/idb-bridge/src/util/types.ts
index 9bf80366d..b0142b0d8 100644
--- a/packages/idb-bridge/src/util/types.ts
+++ b/packages/idb-bridge/src/util/types.ts
@@ -15,11 +15,11 @@
  permissions and limitations under the License.
 */
 
-import BridgeIDBRequest from "../BridgeIDBRequest";
-import BridgeIDBKeyRange from "../BridgeIDBKeyRange";
-import BridgeIDBIndex from "../BridgeIDBIndex";
-import BridgeIBObjectStore from "../BridgeIDBObjectStore";
+import { BridgeIDBRequest } from "../BridgeIDBRequest";
+import { BridgeIDBKeyRange } from "../BridgeIDBKeyRange";
+import { BridgeIDBIndex } from "../BridgeIDBIndex";
 import { Event } from "../util/FakeEvent";
+import { BridgeIDBObjectStore } from "../BridgeIDBObjectStore";
 
 interface EventInCallback extends Event {
   target: any;
@@ -37,15 +37,18 @@ export type EventType =
   | "upgradeneeded"
   | "versionchange";
 
-export type CursorSource = BridgeIDBIndex | BridgeIBObjectStore;
-
+export type CursorSource = BridgeIDBIndex | BridgeIDBObjectStore;
 
 export interface FakeDOMStringList extends Array<string> {
   contains: (value: string) => boolean;
   item: (i: number) => string | undefined;
 }
 
-export type BridgeIDBCursorDirection = "next" | "nextunique" | "prev" | "prevunique";
+export type BridgeIDBCursorDirection =
+  | "next"
+  | "nextunique"
+  | "prev"
+  | "prevunique";
 
 export type KeyPath = string | string[];
 
@@ -64,8 +67,8 @@ export type TransactionMode = "readonly" | "readwrite" | "versionchange";
 
 export interface BridgeIDBDatabaseInfo {
   name: string;
-  version: number
-};
+  version: number;
+}
 
 export interface RequestObj {
   operation: () => Promise<any>;
diff --git a/packages/idb-bridge/src/util/validateKeyPath.ts b/packages/idb-bridge/src/util/validateKeyPath.ts
index 18552a5d4..072832190 100644
--- a/packages/idb-bridge/src/util/validateKeyPath.ts
+++ b/packages/idb-bridge/src/util/validateKeyPath.ts
@@ -18,60 +18,60 @@ import { KeyPath } from "./types";
 
 // http://www.w3.org/TR/2015/REC-IndexedDB-20150108/#dfn-valid-key-path
 const validateKeyPath = (keyPath: KeyPath, parent?: "array" | "string") => {
-    // This doesn't make sense to me based on the spec, but it is needed to pass the W3C KeyPath tests (see same
-    // comment in extractKey)
-    if (
-        keyPath !== undefined &&
-        keyPath !== null &&
-        typeof keyPath !== "string" &&
-        keyPath.toString &&
-        (parent === "array" || !Array.isArray(keyPath))
-    ) {
-        keyPath = keyPath.toString();
-    }
+  // This doesn't make sense to me based on the spec, but it is needed to pass the W3C KeyPath tests (see same
+  // comment in extractKey)
+  if (
+    keyPath !== undefined &&
+    keyPath !== null &&
+    typeof keyPath !== "string" &&
+    keyPath.toString &&
+    (parent === "array" || !Array.isArray(keyPath))
+  ) {
+    keyPath = keyPath.toString();
+  }
 
-    if (typeof keyPath === "string") {
-        if (keyPath === "" && parent !== "string") {
-            return;
-        }
-        try {
-            // https://mathiasbynens.be/demo/javascript-identifier-regex for ECMAScript 5.1 / Unicode v7.0.0, with
-            // reserved words at beginning removed
-            // tslint:disable-next-line max-line-length
-            const validIdentifierRegex = /^(?:[\$A-Z_a-z\xAA\xB5\xBA\xC0-\xD6\xD8-\xF6\xF8-\u02C1\u02C6-\u02D1\u02E0-\u02E4\u02EC\u02EE\u0370-\u0374\u0376\u0377\u037A-\u037D\u037F\u0386\u0388-\u038A\u038C\u038E-\u03A1\u03A3-\u03F5\u03F7-\u0481\u048A-\u052F\u0531-\u0556\u0559\u0561-\u0587\u05D0-\u05EA\u05F0-\u05F2\u0620-\u064A\u066E\u066F\u0671-\u06D3\u06D5\u06E5\u06E6\u06EE\u06EF\u06FA-\u06FC\u06FF\u0710\u0712-\u072F\u074D-\u07A5\u07B1\u07CA-\u07EA\u07F4\u07F5\u07FA\u0800-\u0815\u081A\u0824\u0828\u0840-\u0858\u08A0-\u08B2\u0904-\u0939\u093D\u0950\u0958-\u0961\u0971-\u0980\u0985-\u098C\u098F\u0990\u0993-\u09A8\u09AA-\u09B0\u09B2\u09B6-\u09B9\u09BD\u09CE\u09DC\u09DD\u09DF-\u09E1\u09F0\u09F1\u0A05-\u0A0A\u0A0F\u0A10\u0A13-\u0A28\u0A2A-\u0A30\u0A32\u0A33\u0A35\u0A36\u0A38\u0A39\u0A59-\u0A5C\u0A5E\u0A72-\u0A74\u0A85-\u0A8D\u0A8F-\u0A91\u0A93-\u0AA8\u0AAA-\u0AB0\u0AB2\u0AB3\u0AB5-\u0AB9\u0ABD\u0AD0\u0AE0\u0AE1\u0B05-\u0B0C\u0B0F\u0B10\u0B13-\u0B28\u0B2A-\u0B30\u0B32\u0B33\u0B35-\u0B39\u0B3D\u0B5C\u0B5D\u0B5F-\u0B61\u0B71\u0B83\u0B85-\u0B8A\u0B8E-\u0B90\u0B92-\u0B95\u0B99\u0B9A\u0B9C\u0B9E\u0B9F\u0BA3\u0BA4\u0BA8-\u0BAA\u0BAE-\u0BB9\u0BD0\u0C05-\u0C0C\u0C0E-\u0C10\u0C12-\u0C28\u0C2A-\u0C39\u0C3D\u0C58\u0C59\u0C60\u0C61\u0C85-\u0C8C\u0C8E-\u0C90\u0C92-\u0CA8\u0CAA-\u0CB3\u0CB5-\u0CB9\u0CBD\u0CDE\u0CE0\u0CE1\u0CF1\u0CF2\u0D05-\u0D0C\u0D0E-\u0D10\u0D12-\u0D3A\u0D3D\u0D4E\u0D60\u0D61\u0D7A-\u0D7F\u0D85-\u0D96\u0D9A-\u0DB1\u0DB3-\u0DBB\u0DBD\u0DC0-\u0DC6\u0E01-\u0E30\u0E32\u0E33\u0E40-\u0E46\u0E81\u0E82\u0E84\u0E87\u0E88\u0E8A\u0E8D\u0E94-\u0E97\u0E99-\u0E9F\u0EA1-\u0EA3\u0EA5\u0EA7\u0EAA\u0EAB\u0EAD-\u0EB0\u0EB2\u0EB3\u0EBD\u0EC0-\u0EC4\u0EC6\u0EDC-\u0EDF\u0F00\u0F40-\u0F47\u0F49-\u0F6C\u0F88-\u0F8C\u1000-\u102A\u103F\u1050-\u1055\u105A-\u105D\u1061\u1065\u1066\u106E-\u1070\u1075-\u1081\u108E\u10A0-\u10C5\u10C7\u10CD\u10D0-\u10FA\u10FC-\u1248\u124A-\u124D\u1250-\u1256\u1258\u125A-\u125D\u1260-\u1288\u128A-\u128D\u1290-\u12B0\u12B2-\u12B5\u12B8-\u12BE\u12C0\u12C2-\u12C5\u12C8-\u12D6\u12D8-\u1310\u1312-\u1315\u1318-\u135A\u1380-\u138F\u13A0-\u13F4\u1401-\u166C\u166F-\u167F\u1681-\u169A\u16A0-\u16EA\u16EE-\u16F8\u1700-\u170C\u170E-\u1711\u1720-\u1731\u1740-\u1751\u1760-\u176C\u176E-\u1770\u1780-\u17B3\u17D7\u17DC\u1820-\u1877\u1880-\u18A8\u18AA\u18B0-\u18F5\u1900-\u191E\u1950-\u196D\u1970-\u1974\u1980-\u19AB\u19C1-\u19C7\u1A00-\u1A16\u1A20-\u1A54\u1AA7\u1B05-\u1B33\u1B45-\u1B4B\u1B83-\u1BA0\u1BAE\u1BAF\u1BBA-\u1BE5\u1C00-\u1C23\u1C4D-\u1C4F\u1C5A-\u1C7D\u1CE9-\u1CEC\u1CEE-\u1CF1\u1CF5\u1CF6\u1D00-\u1DBF\u1E00-\u1F15\u1F18-\u1F1D\u1F20-\u1F45\u1F48-\u1F4D\u1F50-\u1F57\u1F59\u1F5B\u1F5D\u1F5F-\u1F7D\u1F80-\u1FB4\u1FB6-\u1FBC\u1FBE\u1FC2-\u1FC4\u1FC6-\u1FCC\u1FD0-\u1FD3\u1FD6-\u1FDB\u1FE0-\u1FEC\u1FF2-\u1FF4\u1FF6-\u1FFC\u2071\u207F\u2090-\u209C\u2102\u2107\u210A-\u2113\u2115\u2119-\u211D\u2124\u2126\u2128\u212A-\u212D\u212F-\u2139\u213C-\u213F\u2145-\u2149\u214E\u2160-\u2188\u2C00-\u2C2E\u2C30-\u2C5E\u2C60-\u2CE4\u2CEB-\u2CEE\u2CF2\u2CF3\u2D00-\u2D25\u2D27\u2D2D\u2D30-\u2D67\u2D6F\u2D80-\u2D96\u2DA0-\u2DA6\u2DA8-\u2DAE\u2DB0-\u2DB6\u2DB8-\u2DBE\u2DC0-\u2DC6\u2DC8-\u2DCE\u2DD0-\u2DD6\u2DD8-\u2DDE\u2E2F\u3005-\u3007\u3021-\u3029\u3031-\u3035\u3038-\u303C\u3041-\u3096\u309D-\u309F\u30A1-\u30FA\u30FC-\u30FF\u3105-\u312D\u3131-\u318E\u31A0-\u31BA\u31F0-\u31FF\u3400-\u4DB5\u4E00-\u9FCC\uA000-\uA48C\uA4D0-\uA4FD\uA500-\uA60C\uA610-\uA61F\uA62A\uA62B\uA640-\uA66E\uA67F-\uA69D\uA6A0-\uA6EF\uA717-\uA71F\uA722-\uA788\uA78B-\uA78E\uA790-\uA7AD\uA7B0\uA7B1\uA7F7-\uA801\uA803-\uA805\uA807-\uA80A\uA80C-\uA822\uA840-\uA873\uA882-\uA8B3\uA8F2-\uA8F7\uA8FB\uA90A-\uA925\uA930-\uA946\uA960-\uA97C\uA984-\uA9B2\uA9CF\uA9E0-\uA9E4\uA9E6-\uA9EF\uA9FA-\uA9FE\uAA00-\uAA28\uAA40-\uAA42\uAA44-\uAA4B\uAA60-\uAA76\uAA7A\uAA7E-\uAAAF\uAAB1\uAAB5\uAAB6\uAAB9-\uAABD\uAAC0\uAAC2\uAADB-\uAADD\uAAE0-\uAAEA\uAAF2-\uAAF4\uAB01-\uAB06\uAB09-\uAB0E\uAB11-\uAB16\uAB20-\uAB26\uAB28-\uAB2E\uAB30-\uAB5A\uAB5C-\uAB5F\uAB64\uAB65\uABC0-\uABE2\uAC00-\uD7A3\uD7B0-\uD7C6\uD7CB-\uD7FB\uF900-\uFA6D\uFA70-\uFAD9\uFB00-\uFB06\uFB13-\uFB17\uFB1D\uFB1F-\uFB28\uFB2A-\uFB36\uFB38-\uFB3C\uFB3E\uFB40\uFB41\uFB43\uFB44\uFB46-\uFBB1\uFBD3-\uFD3D\uFD50-\uFD8F\uFD92-\uFDC7\uFDF0-\uFDFB\uFE70-\uFE74\uFE76-\uFEFC\uFF21-\uFF3A\uFF41-\uFF5A\uFF66-\uFFBE\uFFC2-\uFFC7\uFFCA-\uFFCF\uFFD2-\uFFD7\uFFDA-\uFFDC])(?:[\$0-9A-Z_a-z\xAA\xB5\xBA\xC0-\xD6\xD8-\xF6\xF8-\u02C1\u02C6-\u02D1\u02E0-\u02E4\u02EC\u02EE\u0300-\u0374\u0376\u0377\u037A-\u037D\u037F\u0386\u0388-\u038A\u038C\u038E-\u03A1\u03A3-\u03F5\u03F7-\u0481\u0483-\u0487\u048A-\u052F\u0531-\u0556\u0559\u0561-\u0587\u0591-\u05BD\u05BF\u05C1\u05C2\u05C4\u05C5\u05C7\u05D0-\u05EA\u05F0-\u05F2\u0610-\u061A\u0620-\u0669\u066E-\u06D3\u06D5-\u06DC\u06DF-\u06E8\u06EA-\u06FC\u06FF\u0710-\u074A\u074D-\u07B1\u07C0-\u07F5\u07FA\u0800-\u082D\u0840-\u085B\u08A0-\u08B2\u08E4-\u0963\u0966-\u096F\u0971-\u0983\u0985-\u098C\u098F\u0990\u0993-\u09A8\u09AA-\u09B0\u09B2\u09B6-\u09B9\u09BC-\u09C4\u09C7\u09C8\u09CB-\u09CE\u09D7\u09DC\u09DD\u09DF-\u09E3\u09E6-\u09F1\u0A01-\u0A03\u0A05-\u0A0A\u0A0F\u0A10\u0A13-\u0A28\u0A2A-\u0A30\u0A32\u0A33\u0A35\u0A36\u0A38\u0A39\u0A3C\u0A3E-\u0A42\u0A47\u0A48\u0A4B-\u0A4D\u0A51\u0A59-\u0A5C\u0A5E\u0A66-\u0A75\u0A81-\u0A83\u0A85-\u0A8D\u0A8F-\u0A91\u0A93-\u0AA8\u0AAA-\u0AB0\u0AB2\u0AB3\u0AB5-\u0AB9\u0ABC-\u0AC5\u0AC7-\u0AC9\u0ACB-\u0ACD\u0AD0\u0AE0-\u0AE3\u0AE6-\u0AEF\u0B01-\u0B03\u0B05-\u0B0C\u0B0F\u0B10\u0B13-\u0B28\u0B2A-\u0B30\u0B32\u0B33\u0B35-\u0B39\u0B3C-\u0B44\u0B47\u0B48\u0B4B-\u0B4D\u0B56\u0B57\u0B5C\u0B5D\u0B5F-\u0B63\u0B66-\u0B6F\u0B71\u0B82\u0B83\u0B85-\u0B8A\u0B8E-\u0B90\u0B92-\u0B95\u0B99\u0B9A\u0B9C\u0B9E\u0B9F\u0BA3\u0BA4\u0BA8-\u0BAA\u0BAE-\u0BB9\u0BBE-\u0BC2\u0BC6-\u0BC8\u0BCA-\u0BCD\u0BD0\u0BD7\u0BE6-\u0BEF\u0C00-\u0C03\u0C05-\u0C0C\u0C0E-\u0C10\u0C12-\u0C28\u0C2A-\u0C39\u0C3D-\u0C44\u0C46-\u0C48\u0C4A-\u0C4D\u0C55\u0C56\u0C58\u0C59\u0C60-\u0C63\u0C66-\u0C6F\u0C81-\u0C83\u0C85-\u0C8C\u0C8E-\u0C90\u0C92-\u0CA8\u0CAA-\u0CB3\u0CB5-\u0CB9\u0CBC-\u0CC4\u0CC6-\u0CC8\u0CCA-\u0CCD\u0CD5\u0CD6\u0CDE\u0CE0-\u0CE3\u0CE6-\u0CEF\u0CF1\u0CF2\u0D01-\u0D03\u0D05-\u0D0C\u0D0E-\u0D10\u0D12-\u0D3A\u0D3D-\u0D44\u0D46-\u0D48\u0D4A-\u0D4E\u0D57\u0D60-\u0D63\u0D66-\u0D6F\u0D7A-\u0D7F\u0D82\u0D83\u0D85-\u0D96\u0D9A-\u0DB1\u0DB3-\u0DBB\u0DBD\u0DC0-\u0DC6\u0DCA\u0DCF-\u0DD4\u0DD6\u0DD8-\u0DDF\u0DE6-\u0DEF\u0DF2\u0DF3\u0E01-\u0E3A\u0E40-\u0E4E\u0E50-\u0E59\u0E81\u0E82\u0E84\u0E87\u0E88\u0E8A\u0E8D\u0E94-\u0E97\u0E99-\u0E9F\u0EA1-\u0EA3\u0EA5\u0EA7\u0EAA\u0EAB\u0EAD-\u0EB9\u0EBB-\u0EBD\u0EC0-\u0EC4\u0EC6\u0EC8-\u0ECD\u0ED0-\u0ED9\u0EDC-\u0EDF\u0F00\u0F18\u0F19\u0F20-\u0F29\u0F35\u0F37\u0F39\u0F3E-\u0F47\u0F49-\u0F6C\u0F71-\u0F84\u0F86-\u0F97\u0F99-\u0FBC\u0FC6\u1000-\u1049\u1050-\u109D\u10A0-\u10C5\u10C7\u10CD\u10D0-\u10FA\u10FC-\u1248\u124A-\u124D\u1250-\u1256\u1258\u125A-\u125D\u1260-\u1288\u128A-\u128D\u1290-\u12B0\u12B2-\u12B5\u12B8-\u12BE\u12C0\u12C2-\u12C5\u12C8-\u12D6\u12D8-\u1310\u1312-\u1315\u1318-\u135A\u135D-\u135F\u1380-\u138F\u13A0-\u13F4\u1401-\u166C\u166F-\u167F\u1681-\u169A\u16A0-\u16EA\u16EE-\u16F8\u1700-\u170C\u170E-\u1714\u1720-\u1734\u1740-\u1753\u1760-\u176C\u176E-\u1770\u1772\u1773\u1780-\u17D3\u17D7\u17DC\u17DD\u17E0-\u17E9\u180B-\u180D\u1810-\u1819\u1820-\u1877\u1880-\u18AA\u18B0-\u18F5\u1900-\u191E\u1920-\u192B\u1930-\u193B\u1946-\u196D\u1970-\u1974\u1980-\u19AB\u19B0-\u19C9\u19D0-\u19D9\u1A00-\u1A1B\u1A20-\u1A5E\u1A60-\u1A7C\u1A7F-\u1A89\u1A90-\u1A99\u1AA7\u1AB0-\u1ABD\u1B00-\u1B4B\u1B50-\u1B59\u1B6B-\u1B73\u1B80-\u1BF3\u1C00-\u1C37\u1C40-\u1C49\u1C4D-\u1C7D\u1CD0-\u1CD2\u1CD4-\u1CF6\u1CF8\u1CF9\u1D00-\u1DF5\u1DFC-\u1F15\u1F18-\u1F1D\u1F20-\u1F45\u1F48-\u1F4D\u1F50-\u1F57\u1F59\u1F5B\u1F5D\u1F5F-\u1F7D\u1F80-\u1FB4\u1FB6-\u1FBC\u1FBE\u1FC2-\u1FC4\u1FC6-\u1FCC\u1FD0-\u1FD3\u1FD6-\u1FDB\u1FE0-\u1FEC\u1FF2-\u1FF4\u1FF6-\u1FFC\u200C\u200D\u203F\u2040\u2054\u2071\u207F\u2090-\u209C\u20D0-\u20DC\u20E1\u20E5-\u20F0\u2102\u2107\u210A-\u2113\u2115\u2119-\u211D\u2124\u2126\u2128\u212A-\u212D\u212F-\u2139\u213C-\u213F\u2145-\u2149\u214E\u2160-\u2188\u2C00-\u2C2E\u2C30-\u2C5E\u2C60-\u2CE4\u2CEB-\u2CF3\u2D00-\u2D25\u2D27\u2D2D\u2D30-\u2D67\u2D6F\u2D7F-\u2D96\u2DA0-\u2DA6\u2DA8-\u2DAE\u2DB0-\u2DB6\u2DB8-\u2DBE\u2DC0-\u2DC6\u2DC8-\u2DCE\u2DD0-\u2DD6\u2DD8-\u2DDE\u2DE0-\u2DFF\u2E2F\u3005-\u3007\u3021-\u302F\u3031-\u3035\u3038-\u303C\u3041-\u3096\u3099\u309A\u309D-\u309F\u30A1-\u30FA\u30FC-\u30FF\u3105-\u312D\u3131-\u318E\u31A0-\u31BA\u31F0-\u31FF\u3400-\u4DB5\u4E00-\u9FCC\uA000-\uA48C\uA4D0-\uA4FD\uA500-\uA60C\uA610-\uA62B\uA640-\uA66F\uA674-\uA67D\uA67F-\uA69D\uA69F-\uA6F1\uA717-\uA71F\uA722-\uA788\uA78B-\uA78E\uA790-\uA7AD\uA7B0\uA7B1\uA7F7-\uA827\uA840-\uA873\uA880-\uA8C4\uA8D0-\uA8D9\uA8E0-\uA8F7\uA8FB\uA900-\uA92D\uA930-\uA953\uA960-\uA97C\uA980-\uA9C0\uA9CF-\uA9D9\uA9E0-\uA9FE\uAA00-\uAA36\uAA40-\uAA4D\uAA50-\uAA59\uAA60-\uAA76\uAA7A-\uAAC2\uAADB-\uAADD\uAAE0-\uAAEF\uAAF2-\uAAF6\uAB01-\uAB06\uAB09-\uAB0E\uAB11-\uAB16\uAB20-\uAB26\uAB28-\uAB2E\uAB30-\uAB5A\uAB5C-\uAB5F\uAB64\uAB65\uABC0-\uABEA\uABEC\uABED\uABF0-\uABF9\uAC00-\uD7A3\uD7B0-\uD7C6\uD7CB-\uD7FB\uF900-\uFA6D\uFA70-\uFAD9\uFB00-\uFB06\uFB13-\uFB17\uFB1D-\uFB28\uFB2A-\uFB36\uFB38-\uFB3C\uFB3E\uFB40\uFB41\uFB43\uFB44\uFB46-\uFBB1\uFBD3-\uFD3D\uFD50-\uFD8F\uFD92-\uFDC7\uFDF0-\uFDFB\uFE00-\uFE0F\uFE20-\uFE2D\uFE33\uFE34\uFE4D-\uFE4F\uFE70-\uFE74\uFE76-\uFEFC\uFF10-\uFF19\uFF21-\uFF3A\uFF3F\uFF41-\uFF5A\uFF66-\uFFBE\uFFC2-\uFFC7\uFFCA-\uFFCF\uFFD2-\uFFD7\uFFDA-\uFFDC])*$/;
-            if (keyPath.length >= 1 && validIdentifierRegex.test(keyPath)) {
-                return;
-            }
-        } catch (err) {
-            throw new SyntaxError(err.message);
-        }
-        if (keyPath.indexOf(" ") >= 0) {
-            throw new SyntaxError(
-                "The keypath argument contains an invalid key path (no spaces allowed).",
-            );
-        }
+  if (typeof keyPath === "string") {
+    if (keyPath === "" && parent !== "string") {
+      return;
     }
-
-    if (Array.isArray(keyPath) && keyPath.length > 0) {
-        if (parent) {
-            // No nested arrays
-            throw new SyntaxError(
-                "The keypath argument contains an invalid key path (nested arrays).",
-            );
-        }
-        for (const part of keyPath) {
-            validateKeyPath(part, "array");
-        }
-        return;
-    } else if (typeof keyPath === "string" && keyPath.indexOf(".") >= 0) {
-        keyPath = keyPath.split(".");
-        for (const part of keyPath) {
-            validateKeyPath(part, "string");
-        }
+    try {
+      // https://mathiasbynens.be/demo/javascript-identifier-regex for ECMAScript 5.1 / Unicode v7.0.0, with
+      // reserved words at beginning removed
+      // tslint:disable-next-line max-line-length
+      const validIdentifierRegex = /^(?:[\$A-Z_a-z\xAA\xB5\xBA\xC0-\xD6\xD8-\xF6\xF8-\u02C1\u02C6-\u02D1\u02E0-\u02E4\u02EC\u02EE\u0370-\u0374\u0376\u0377\u037A-\u037D\u037F\u0386\u0388-\u038A\u038C\u038E-\u03A1\u03A3-\u03F5\u03F7-\u0481\u048A-\u052F\u0531-\u0556\u0559\u0561-\u0587\u05D0-\u05EA\u05F0-\u05F2\u0620-\u064A\u066E\u066F\u0671-\u06D3\u06D5\u06E5\u06E6\u06EE\u06EF\u06FA-\u06FC\u06FF\u0710\u0712-\u072F\u074D-\u07A5\u07B1\u07CA-\u07EA\u07F4\u07F5\u07FA\u0800-\u0815\u081A\u0824\u0828\u0840-\u0858\u08A0-\u08B2\u0904-\u0939\u093D\u0950\u0958-\u0961\u0971-\u0980\u0985-\u098C\u098F\u0990\u0993-\u09A8\u09AA-\u09B0\u09B2\u09B6-\u09B9\u09BD\u09CE\u09DC\u09DD\u09DF-\u09E1\u09F0\u09F1\u0A05-\u0A0A\u0A0F\u0A10\u0A13-\u0A28\u0A2A-\u0A30\u0A32\u0A33\u0A35\u0A36\u0A38\u0A39\u0A59-\u0A5C\u0A5E\u0A72-\u0A74\u0A85-\u0A8D\u0A8F-\u0A91\u0A93-\u0AA8\u0AAA-\u0AB0\u0AB2\u0AB3\u0AB5-\u0AB9\u0ABD\u0AD0\u0AE0\u0AE1\u0B05-\u0B0C\u0B0F\u0B10\u0B13-\u0B28\u0B2A-\u0B30\u0B32\u0B33\u0B35-\u0B39\u0B3D\u0B5C\u0B5D\u0B5F-\u0B61\u0B71\u0B83\u0B85-\u0B8A\u0B8E-\u0B90\u0B92-\u0B95\u0B99\u0B9A\u0B9C\u0B9E\u0B9F\u0BA3\u0BA4\u0BA8-\u0BAA\u0BAE-\u0BB9\u0BD0\u0C05-\u0C0C\u0C0E-\u0C10\u0C12-\u0C28\u0C2A-\u0C39\u0C3D\u0C58\u0C59\u0C60\u0C61\u0C85-\u0C8C\u0C8E-\u0C90\u0C92-\u0CA8\u0CAA-\u0CB3\u0CB5-\u0CB9\u0CBD\u0CDE\u0CE0\u0CE1\u0CF1\u0CF2\u0D05-\u0D0C\u0D0E-\u0D10\u0D12-\u0D3A\u0D3D\u0D4E\u0D60\u0D61\u0D7A-\u0D7F\u0D85-\u0D96\u0D9A-\u0DB1\u0DB3-\u0DBB\u0DBD\u0DC0-\u0DC6\u0E01-\u0E30\u0E32\u0E33\u0E40-\u0E46\u0E81\u0E82\u0E84\u0E87\u0E88\u0E8A\u0E8D\u0E94-\u0E97\u0E99-\u0E9F\u0EA1-\u0EA3\u0EA5\u0EA7\u0EAA\u0EAB\u0EAD-\u0EB0\u0EB2\u0EB3\u0EBD\u0EC0-\u0EC4\u0EC6\u0EDC-\u0EDF\u0F00\u0F40-\u0F47\u0F49-\u0F6C\u0F88-\u0F8C\u1000-\u102A\u103F\u1050-\u1055\u105A-\u105D\u1061\u1065\u1066\u106E-\u1070\u1075-\u1081\u108E\u10A0-\u10C5\u10C7\u10CD\u10D0-\u10FA\u10FC-\u1248\u124A-\u124D\u1250-\u1256\u1258\u125A-\u125D\u1260-\u1288\u128A-\u128D\u1290-\u12B0\u12B2-\u12B5\u12B8-\u12BE\u12C0\u12C2-\u12C5\u12C8-\u12D6\u12D8-\u1310\u1312-\u1315\u1318-\u135A\u1380-\u138F\u13A0-\u13F4\u1401-\u166C\u166F-\u167F\u1681-\u169A\u16A0-\u16EA\u16EE-\u16F8\u1700-\u170C\u170E-\u1711\u1720-\u1731\u1740-\u1751\u1760-\u176C\u176E-\u1770\u1780-\u17B3\u17D7\u17DC\u1820-\u1877\u1880-\u18A8\u18AA\u18B0-\u18F5\u1900-\u191E\u1950-\u196D\u1970-\u1974\u1980-\u19AB\u19C1-\u19C7\u1A00-\u1A16\u1A20-\u1A54\u1AA7\u1B05-\u1B33\u1B45-\u1B4B\u1B83-\u1BA0\u1BAE\u1BAF\u1BBA-\u1BE5\u1C00-\u1C23\u1C4D-\u1C4F\u1C5A-\u1C7D\u1CE9-\u1CEC\u1CEE-\u1CF1\u1CF5\u1CF6\u1D00-\u1DBF\u1E00-\u1F15\u1F18-\u1F1D\u1F20-\u1F45\u1F48-\u1F4D\u1F50-\u1F57\u1F59\u1F5B\u1F5D\u1F5F-\u1F7D\u1F80-\u1FB4\u1FB6-\u1FBC\u1FBE\u1FC2-\u1FC4\u1FC6-\u1FCC\u1FD0-\u1FD3\u1FD6-\u1FDB\u1FE0-\u1FEC\u1FF2-\u1FF4\u1FF6-\u1FFC\u2071\u207F\u2090-\u209C\u2102\u2107\u210A-\u2113\u2115\u2119-\u211D\u2124\u2126\u2128\u212A-\u212D\u212F-\u2139\u213C-\u213F\u2145-\u2149\u214E\u2160-\u2188\u2C00-\u2C2E\u2C30-\u2C5E\u2C60-\u2CE4\u2CEB-\u2CEE\u2CF2\u2CF3\u2D00-\u2D25\u2D27\u2D2D\u2D30-\u2D67\u2D6F\u2D80-\u2D96\u2DA0-\u2DA6\u2DA8-\u2DAE\u2DB0-\u2DB6\u2DB8-\u2DBE\u2DC0-\u2DC6\u2DC8-\u2DCE\u2DD0-\u2DD6\u2DD8-\u2DDE\u2E2F\u3005-\u3007\u3021-\u3029\u3031-\u3035\u3038-\u303C\u3041-\u3096\u309D-\u309F\u30A1-\u30FA\u30FC-\u30FF\u3105-\u312D\u3131-\u318E\u31A0-\u31BA\u31F0-\u31FF\u3400-\u4DB5\u4E00-\u9FCC\uA000-\uA48C\uA4D0-\uA4FD\uA500-\uA60C\uA610-\uA61F\uA62A\uA62B\uA640-\uA66E\uA67F-\uA69D\uA6A0-\uA6EF\uA717-\uA71F\uA722-\uA788\uA78B-\uA78E\uA790-\uA7AD\uA7B0\uA7B1\uA7F7-\uA801\uA803-\uA805\uA807-\uA80A\uA80C-\uA822\uA840-\uA873\uA882-\uA8B3\uA8F2-\uA8F7\uA8FB\uA90A-\uA925\uA930-\uA946\uA960-\uA97C\uA984-\uA9B2\uA9CF\uA9E0-\uA9E4\uA9E6-\uA9EF\uA9FA-\uA9FE\uAA00-\uAA28\uAA40-\uAA42\uAA44-\uAA4B\uAA60-\uAA76\uAA7A\uAA7E-\uAAAF\uAAB1\uAAB5\uAAB6\uAAB9-\uAABD\uAAC0\uAAC2\uAADB-\uAADD\uAAE0-\uAAEA\uAAF2-\uAAF4\uAB01-\uAB06\uAB09-\uAB0E\uAB11-\uAB16\uAB20-\uAB26\uAB28-\uAB2E\uAB30-\uAB5A\uAB5C-\uAB5F\uAB64\uAB65\uABC0-\uABE2\uAC00-\uD7A3\uD7B0-\uD7C6\uD7CB-\uD7FB\uF900-\uFA6D\uFA70-\uFAD9\uFB00-\uFB06\uFB13-\uFB17\uFB1D\uFB1F-\uFB28\uFB2A-\uFB36\uFB38-\uFB3C\uFB3E\uFB40\uFB41\uFB43\uFB44\uFB46-\uFBB1\uFBD3-\uFD3D\uFD50-\uFD8F\uFD92-\uFDC7\uFDF0-\uFDFB\uFE70-\uFE74\uFE76-\uFEFC\uFF21-\uFF3A\uFF41-\uFF5A\uFF66-\uFFBE\uFFC2-\uFFC7\uFFCA-\uFFCF\uFFD2-\uFFD7\uFFDA-\uFFDC])(?:[\$0-9A-Z_a-z\xAA\xB5\xBA\xC0-\xD6\xD8-\xF6\xF8-\u02C1\u02C6-\u02D1\u02E0-\u02E4\u02EC\u02EE\u0300-\u0374\u0376\u0377\u037A-\u037D\u037F\u0386\u0388-\u038A\u038C\u038E-\u03A1\u03A3-\u03F5\u03F7-\u0481\u0483-\u0487\u048A-\u052F\u0531-\u0556\u0559\u0561-\u0587\u0591-\u05BD\u05BF\u05C1\u05C2\u05C4\u05C5\u05C7\u05D0-\u05EA\u05F0-\u05F2\u0610-\u061A\u0620-\u0669\u066E-\u06D3\u06D5-\u06DC\u06DF-\u06E8\u06EA-\u06FC\u06FF\u0710-\u074A\u074D-\u07B1\u07C0-\u07F5\u07FA\u0800-\u082D\u0840-\u085B\u08A0-\u08B2\u08E4-\u0963\u0966-\u096F\u0971-\u0983\u0985-\u098C\u098F\u0990\u0993-\u09A8\u09AA-\u09B0\u09B2\u09B6-\u09B9\u09BC-\u09C4\u09C7\u09C8\u09CB-\u09CE\u09D7\u09DC\u09DD\u09DF-\u09E3\u09E6-\u09F1\u0A01-\u0A03\u0A05-\u0A0A\u0A0F\u0A10\u0A13-\u0A28\u0A2A-\u0A30\u0A32\u0A33\u0A35\u0A36\u0A38\u0A39\u0A3C\u0A3E-\u0A42\u0A47\u0A48\u0A4B-\u0A4D\u0A51\u0A59-\u0A5C\u0A5E\u0A66-\u0A75\u0A81-\u0A83\u0A85-\u0A8D\u0A8F-\u0A91\u0A93-\u0AA8\u0AAA-\u0AB0\u0AB2\u0AB3\u0AB5-\u0AB9\u0ABC-\u0AC5\u0AC7-\u0AC9\u0ACB-\u0ACD\u0AD0\u0AE0-\u0AE3\u0AE6-\u0AEF\u0B01-\u0B03\u0B05-\u0B0C\u0B0F\u0B10\u0B13-\u0B28\u0B2A-\u0B30\u0B32\u0B33\u0B35-\u0B39\u0B3C-\u0B44\u0B47\u0B48\u0B4B-\u0B4D\u0B56\u0B57\u0B5C\u0B5D\u0B5F-\u0B63\u0B66-\u0B6F\u0B71\u0B82\u0B83\u0B85-\u0B8A\u0B8E-\u0B90\u0B92-\u0B95\u0B99\u0B9A\u0B9C\u0B9E\u0B9F\u0BA3\u0BA4\u0BA8-\u0BAA\u0BAE-\u0BB9\u0BBE-\u0BC2\u0BC6-\u0BC8\u0BCA-\u0BCD\u0BD0\u0BD7\u0BE6-\u0BEF\u0C00-\u0C03\u0C05-\u0C0C\u0C0E-\u0C10\u0C12-\u0C28\u0C2A-\u0C39\u0C3D-\u0C44\u0C46-\u0C48\u0C4A-\u0C4D\u0C55\u0C56\u0C58\u0C59\u0C60-\u0C63\u0C66-\u0C6F\u0C81-\u0C83\u0C85-\u0C8C\u0C8E-\u0C90\u0C92-\u0CA8\u0CAA-\u0CB3\u0CB5-\u0CB9\u0CBC-\u0CC4\u0CC6-\u0CC8\u0CCA-\u0CCD\u0CD5\u0CD6\u0CDE\u0CE0-\u0CE3\u0CE6-\u0CEF\u0CF1\u0CF2\u0D01-\u0D03\u0D05-\u0D0C\u0D0E-\u0D10\u0D12-\u0D3A\u0D3D-\u0D44\u0D46-\u0D48\u0D4A-\u0D4E\u0D57\u0D60-\u0D63\u0D66-\u0D6F\u0D7A-\u0D7F\u0D82\u0D83\u0D85-\u0D96\u0D9A-\u0DB1\u0DB3-\u0DBB\u0DBD\u0DC0-\u0DC6\u0DCA\u0DCF-\u0DD4\u0DD6\u0DD8-\u0DDF\u0DE6-\u0DEF\u0DF2\u0DF3\u0E01-\u0E3A\u0E40-\u0E4E\u0E50-\u0E59\u0E81\u0E82\u0E84\u0E87\u0E88\u0E8A\u0E8D\u0E94-\u0E97\u0E99-\u0E9F\u0EA1-\u0EA3\u0EA5\u0EA7\u0EAA\u0EAB\u0EAD-\u0EB9\u0EBB-\u0EBD\u0EC0-\u0EC4\u0EC6\u0EC8-\u0ECD\u0ED0-\u0ED9\u0EDC-\u0EDF\u0F00\u0F18\u0F19\u0F20-\u0F29\u0F35\u0F37\u0F39\u0F3E-\u0F47\u0F49-\u0F6C\u0F71-\u0F84\u0F86-\u0F97\u0F99-\u0FBC\u0FC6\u1000-\u1049\u1050-\u109D\u10A0-\u10C5\u10C7\u10CD\u10D0-\u10FA\u10FC-\u1248\u124A-\u124D\u1250-\u1256\u1258\u125A-\u125D\u1260-\u1288\u128A-\u128D\u1290-\u12B0\u12B2-\u12B5\u12B8-\u12BE\u12C0\u12C2-\u12C5\u12C8-\u12D6\u12D8-\u1310\u1312-\u1315\u1318-\u135A\u135D-\u135F\u1380-\u138F\u13A0-\u13F4\u1401-\u166C\u166F-\u167F\u1681-\u169A\u16A0-\u16EA\u16EE-\u16F8\u1700-\u170C\u170E-\u1714\u1720-\u1734\u1740-\u1753\u1760-\u176C\u176E-\u1770\u1772\u1773\u1780-\u17D3\u17D7\u17DC\u17DD\u17E0-\u17E9\u180B-\u180D\u1810-\u1819\u1820-\u1877\u1880-\u18AA\u18B0-\u18F5\u1900-\u191E\u1920-\u192B\u1930-\u193B\u1946-\u196D\u1970-\u1974\u1980-\u19AB\u19B0-\u19C9\u19D0-\u19D9\u1A00-\u1A1B\u1A20-\u1A5E\u1A60-\u1A7C\u1A7F-\u1A89\u1A90-\u1A99\u1AA7\u1AB0-\u1ABD\u1B00-\u1B4B\u1B50-\u1B59\u1B6B-\u1B73\u1B80-\u1BF3\u1C00-\u1C37\u1C40-\u1C49\u1C4D-\u1C7D\u1CD0-\u1CD2\u1CD4-\u1CF6\u1CF8\u1CF9\u1D00-\u1DF5\u1DFC-\u1F15\u1F18-\u1F1D\u1F20-\u1F45\u1F48-\u1F4D\u1F50-\u1F57\u1F59\u1F5B\u1F5D\u1F5F-\u1F7D\u1F80-\u1FB4\u1FB6-\u1FBC\u1FBE\u1FC2-\u1FC4\u1FC6-\u1FCC\u1FD0-\u1FD3\u1FD6-\u1FDB\u1FE0-\u1FEC\u1FF2-\u1FF4\u1FF6-\u1FFC\u200C\u200D\u203F\u2040\u2054\u2071\u207F\u2090-\u209C\u20D0-\u20DC\u20E1\u20E5-\u20F0\u2102\u2107\u210A-\u2113\u2115\u2119-\u211D\u2124\u2126\u2128\u212A-\u212D\u212F-\u2139\u213C-\u213F\u2145-\u2149\u214E\u2160-\u2188\u2C00-\u2C2E\u2C30-\u2C5E\u2C60-\u2CE4\u2CEB-\u2CF3\u2D00-\u2D25\u2D27\u2D2D\u2D30-\u2D67\u2D6F\u2D7F-\u2D96\u2DA0-\u2DA6\u2DA8-\u2DAE\u2DB0-\u2DB6\u2DB8-\u2DBE\u2DC0-\u2DC6\u2DC8-\u2DCE\u2DD0-\u2DD6\u2DD8-\u2DDE\u2DE0-\u2DFF\u2E2F\u3005-\u3007\u3021-\u302F\u3031-\u3035\u3038-\u303C\u3041-\u3096\u3099\u309A\u309D-\u309F\u30A1-\u30FA\u30FC-\u30FF\u3105-\u312D\u3131-\u318E\u31A0-\u31BA\u31F0-\u31FF\u3400-\u4DB5\u4E00-\u9FCC\uA000-\uA48C\uA4D0-\uA4FD\uA500-\uA60C\uA610-\uA62B\uA640-\uA66F\uA674-\uA67D\uA67F-\uA69D\uA69F-\uA6F1\uA717-\uA71F\uA722-\uA788\uA78B-\uA78E\uA790-\uA7AD\uA7B0\uA7B1\uA7F7-\uA827\uA840-\uA873\uA880-\uA8C4\uA8D0-\uA8D9\uA8E0-\uA8F7\uA8FB\uA900-\uA92D\uA930-\uA953\uA960-\uA97C\uA980-\uA9C0\uA9CF-\uA9D9\uA9E0-\uA9FE\uAA00-\uAA36\uAA40-\uAA4D\uAA50-\uAA59\uAA60-\uAA76\uAA7A-\uAAC2\uAADB-\uAADD\uAAE0-\uAAEF\uAAF2-\uAAF6\uAB01-\uAB06\uAB09-\uAB0E\uAB11-\uAB16\uAB20-\uAB26\uAB28-\uAB2E\uAB30-\uAB5A\uAB5C-\uAB5F\uAB64\uAB65\uABC0-\uABEA\uABEC\uABED\uABF0-\uABF9\uAC00-\uD7A3\uD7B0-\uD7C6\uD7CB-\uD7FB\uF900-\uFA6D\uFA70-\uFAD9\uFB00-\uFB06\uFB13-\uFB17\uFB1D-\uFB28\uFB2A-\uFB36\uFB38-\uFB3C\uFB3E\uFB40\uFB41\uFB43\uFB44\uFB46-\uFBB1\uFBD3-\uFD3D\uFD50-\uFD8F\uFD92-\uFDC7\uFDF0-\uFDFB\uFE00-\uFE0F\uFE20-\uFE2D\uFE33\uFE34\uFE4D-\uFE4F\uFE70-\uFE74\uFE76-\uFEFC\uFF10-\uFF19\uFF21-\uFF3A\uFF3F\uFF41-\uFF5A\uFF66-\uFFBE\uFFC2-\uFFC7\uFFCA-\uFFCF\uFFD2-\uFFD7\uFFDA-\uFFDC])*$/;
+      if (keyPath.length >= 1 && validIdentifierRegex.test(keyPath)) {
         return;
+      }
+    } catch (err) {
+      throw new SyntaxError(err.message);
+    }
+    if (keyPath.indexOf(" ") >= 0) {
+      throw new SyntaxError(
+        "The keypath argument contains an invalid key path (no spaces allowed).",
+      );
+    }
+  }
+
+  if (Array.isArray(keyPath) && keyPath.length > 0) {
+    if (parent) {
+      // No nested arrays
+      throw new SyntaxError(
+        "The keypath argument contains an invalid key path (nested arrays).",
+      );
+    }
+    for (const part of keyPath) {
+      validateKeyPath(part, "array");
+    }
+    return;
+  } else if (typeof keyPath === "string" && keyPath.indexOf(".") >= 0) {
+    keyPath = keyPath.split(".");
+    for (const part of keyPath) {
+      validateKeyPath(part, "string");
     }
+    return;
+  }
 
-    throw new SyntaxError();
+  throw new SyntaxError();
 };
 
 export default validateKeyPath;
diff --git a/packages/idb-bridge/src/util/valueToKey.ts b/packages/idb-bridge/src/util/valueToKey.ts
index 85c8c409f..5cf5b2b1b 100644
--- a/packages/idb-bridge/src/util/valueToKey.ts
+++ b/packages/idb-bridge/src/util/valueToKey.ts
@@ -62,7 +62,6 @@ function valueToKey(input: any, seen?: Set<object>): Key | Key[] {
     }
     return keys;
   } else {
-    
     throw new DataError();
   }
 }
diff --git a/packages/idb-bridge/tsconfig.json b/packages/idb-bridge/tsconfig.json
index 017afdae1..6e41df65d 100644
--- a/packages/idb-bridge/tsconfig.json
+++ b/packages/idb-bridge/tsconfig.json
@@ -1,16 +1,21 @@
 {
     "compilerOptions": {
+        "composite": true,
         "lib": ["es6"],
-        "module": "commonjs",
-        "target": "es5",
+        "module": "ESNext",
+        "moduleResolution": "node",
+        "target": "ES6",
         "noImplicitAny": true,
-        "outDir": "build",
+        "outDir": "lib",
         "declaration": true,
         "noEmitOnError": true,
         "strict": true,
         "incremental": true,
         "sourceMap": true,
-        "types": []
+        "rootDir": "./src",
+        "esModuleInterop": true,
+        "importHelpers": true,
+        "typeRoots": ["./node_modules/@types"]
     },
     "include": ["src/**/*"]
 }
diff --git a/packages/idb-bridge/yarn.lock b/packages/idb-bridge/yarn.lock
deleted file mode 100644
index 9a5daad32..000000000
--- a/packages/idb-bridge/yarn.lock
+++ /dev/null
@@ -1,2689 +0,0 @@
-# THIS IS AN AUTOGENERATED FILE. DO NOT EDIT THIS FILE DIRECTLY.
-# yarn lockfile v1
-
-
-"@ava/babel-plugin-throws-helper@^4.0.0":
-  version "4.0.0"
-  resolved "https://registry.yarnpkg.com/@ava/babel-plugin-throws-helper/-/babel-plugin-throws-helper-4.0.0.tgz#8f5b45b7a0a79c6f4032de2101e0c221847efb62"
-  integrity sha512-3diBLIVBPPh3j4+hb5lo0I1D+S/O/VDJPI4Y502apBxmwEqjyXG4gTSPFUlm41sSZeZzMarT/Gzovw9kV7An0w==
-
-"@ava/babel-preset-stage-4@^4.0.0":
-  version "4.0.0"
-  resolved "https://registry.yarnpkg.com/@ava/babel-preset-stage-4/-/babel-preset-stage-4-4.0.0.tgz#9be5a59ead170062e228bb6ffd2b29f0489424fd"
-  integrity sha512-lZEV1ZANzfzSYBU6WHSErsy7jLPbD1iIgAboASPMcKo7woVni5/5IKWeT0RxC8rY802MFktur3OKEw2JY1Tv2w==
-  dependencies:
-    "@babel/plugin-proposal-async-generator-functions" "^7.2.0"
-    "@babel/plugin-proposal-dynamic-import" "^7.5.0"
-    "@babel/plugin-proposal-optional-catch-binding" "^7.2.0"
-    "@babel/plugin-transform-dotall-regex" "^7.4.4"
-    "@babel/plugin-transform-modules-commonjs" "^7.5.0"
-
-"@ava/babel-preset-transform-test-files@^6.0.0":
-  version "6.0.0"
-  resolved "https://registry.yarnpkg.com/@ava/babel-preset-transform-test-files/-/babel-preset-transform-test-files-6.0.0.tgz#639e8929d2cdc8863c1f16020ce644c525723cd4"
-  integrity sha512-8eKhFzZp7Qcq1VLfoC75ggGT8nQs9q8fIxltU47yCB7Wi7Y8Qf6oqY1Bm0z04fIec24vEgr0ENhDHEOUGVDqnA==
-  dependencies:
-    "@ava/babel-plugin-throws-helper" "^4.0.0"
-    babel-plugin-espower "^3.0.1"
-
-"@babel/code-frame@^7.0.0", "@babel/code-frame@^7.5.5":
-  version "7.5.5"
-  resolved "https://registry.yarnpkg.com/@babel/code-frame/-/code-frame-7.5.5.tgz#bc0782f6d69f7b7d49531219699b988f669a8f9d"
-  integrity sha512-27d4lZoomVyo51VegxI20xZPuSHusqbQag/ztrBC7wegWoQ1nLREPVSKSW8byhTlzTKyNE4ifaTA6lCp7JjpFw==
-  dependencies:
-    "@babel/highlight" "^7.0.0"
-
-"@babel/core@^7.5.5":
-  version "7.5.5"
-  resolved "https://registry.yarnpkg.com/@babel/core/-/core-7.5.5.tgz#17b2686ef0d6bc58f963dddd68ab669755582c30"
-  integrity sha512-i4qoSr2KTtce0DmkuuQBV4AuQgGPUcPXMr9L5MyYAtk06z068lQ10a4O009fe5OB/DfNV+h+qqT7ddNV8UnRjg==
-  dependencies:
-    "@babel/code-frame" "^7.5.5"
-    "@babel/generator" "^7.5.5"
-    "@babel/helpers" "^7.5.5"
-    "@babel/parser" "^7.5.5"
-    "@babel/template" "^7.4.4"
-    "@babel/traverse" "^7.5.5"
-    "@babel/types" "^7.5.5"
-    convert-source-map "^1.1.0"
-    debug "^4.1.0"
-    json5 "^2.1.0"
-    lodash "^4.17.13"
-    resolve "^1.3.2"
-    semver "^5.4.1"
-    source-map "^0.5.0"
-
-"@babel/generator@^7.0.0", "@babel/generator@^7.5.5":
-  version "7.5.5"
-  resolved "https://registry.yarnpkg.com/@babel/generator/-/generator-7.5.5.tgz#873a7f936a3c89491b43536d12245b626664e3cf"
-  integrity sha512-ETI/4vyTSxTzGnU2c49XHv2zhExkv9JHLTwDAFz85kmcwuShvYG2H08FwgIguQf4JC75CBnXAUM5PqeF4fj0nQ==
-  dependencies:
-    "@babel/types" "^7.5.5"
-    jsesc "^2.5.1"
-    lodash "^4.17.13"
-    source-map "^0.5.0"
-    trim-right "^1.0.1"
-
-"@babel/helper-annotate-as-pure@^7.0.0":
-  version "7.0.0"
-  resolved "https://registry.yarnpkg.com/@babel/helper-annotate-as-pure/-/helper-annotate-as-pure-7.0.0.tgz#323d39dd0b50e10c7c06ca7d7638e6864d8c5c32"
-  integrity sha512-3UYcJUj9kvSLbLbUIfQTqzcy5VX7GRZ/CCDrnOaZorFFM01aXp1+GJwuFGV4NDDoAS+mOUyHcO6UD/RfqOks3Q==
-  dependencies:
-    "@babel/types" "^7.0.0"
-
-"@babel/helper-function-name@^7.1.0":
-  version "7.1.0"
-  resolved "https://registry.yarnpkg.com/@babel/helper-function-name/-/helper-function-name-7.1.0.tgz#a0ceb01685f73355d4360c1247f582bfafc8ff53"
-  integrity sha512-A95XEoCpb3TO+KZzJ4S/5uW5fNe26DjBGqf1o9ucyLyCmi1dXq/B3c8iaWTfBk3VvetUxl16e8tIrd5teOCfGw==
-  dependencies:
-    "@babel/helper-get-function-arity" "^7.0.0"
-    "@babel/template" "^7.1.0"
-    "@babel/types" "^7.0.0"
-
-"@babel/helper-get-function-arity@^7.0.0":
-  version "7.0.0"
-  resolved "https://registry.yarnpkg.com/@babel/helper-get-function-arity/-/helper-get-function-arity-7.0.0.tgz#83572d4320e2a4657263734113c42868b64e49c3"
-  integrity sha512-r2DbJeg4svYvt3HOS74U4eWKsUAMRH01Z1ds1zx8KNTPtpTL5JAsdFv8BNyOpVqdFhHkkRDIg5B4AsxmkjAlmQ==
-  dependencies:
-    "@babel/types" "^7.0.0"
-
-"@babel/helper-module-imports@^7.0.0":
-  version "7.0.0"
-  resolved "https://registry.yarnpkg.com/@babel/helper-module-imports/-/helper-module-imports-7.0.0.tgz#96081b7111e486da4d2cd971ad1a4fe216cc2e3d"
-  integrity sha512-aP/hlLq01DWNEiDg4Jn23i+CXxW/owM4WpDLFUbpjxe4NS3BhLVZQ5i7E0ZrxuQ/vwekIeciyamgB1UIYxxM6A==
-  dependencies:
-    "@babel/types" "^7.0.0"
-
-"@babel/helper-module-transforms@^7.4.4":
-  version "7.5.5"
-  resolved "https://registry.yarnpkg.com/@babel/helper-module-transforms/-/helper-module-transforms-7.5.5.tgz#f84ff8a09038dcbca1fd4355661a500937165b4a"
-  integrity sha512-jBeCvETKuJqeiaCdyaheF40aXnnU1+wkSiUs/IQg3tB85up1LyL8x77ClY8qJpuRJUcXQo+ZtdNESmZl4j56Pw==
-  dependencies:
-    "@babel/helper-module-imports" "^7.0.0"
-    "@babel/helper-simple-access" "^7.1.0"
-    "@babel/helper-split-export-declaration" "^7.4.4"
-    "@babel/template" "^7.4.4"
-    "@babel/types" "^7.5.5"
-    lodash "^4.17.13"
-
-"@babel/helper-plugin-utils@^7.0.0":
-  version "7.0.0"
-  resolved "https://registry.yarnpkg.com/@babel/helper-plugin-utils/-/helper-plugin-utils-7.0.0.tgz#bbb3fbee98661c569034237cc03967ba99b4f250"
-  integrity sha512-CYAOUCARwExnEixLdB6sDm2dIJ/YgEAKDM1MOeMeZu9Ld/bDgVo8aiWrXwcY7OBh+1Ea2uUcVRcxKk0GJvW7QA==
-
-"@babel/helper-regex@^7.4.4":
-  version "7.5.5"
-  resolved "https://registry.yarnpkg.com/@babel/helper-regex/-/helper-regex-7.5.5.tgz#0aa6824f7100a2e0e89c1527c23936c152cab351"
-  integrity sha512-CkCYQLkfkiugbRDO8eZn6lRuR8kzZoGXCg3149iTk5se7g6qykSpy3+hELSwquhu+TgHn8nkLiBwHvNX8Hofcw==
-  dependencies:
-    lodash "^4.17.13"
-
-"@babel/helper-remap-async-to-generator@^7.1.0":
-  version "7.1.0"
-  resolved "https://registry.yarnpkg.com/@babel/helper-remap-async-to-generator/-/helper-remap-async-to-generator-7.1.0.tgz#361d80821b6f38da75bd3f0785ece20a88c5fe7f"
-  integrity sha512-3fOK0L+Fdlg8S5al8u/hWE6vhufGSn0bN09xm2LXMy//REAF8kDCrYoOBKYmA8m5Nom+sV9LyLCwrFynA8/slg==
-  dependencies:
-    "@babel/helper-annotate-as-pure" "^7.0.0"
-    "@babel/helper-wrap-function" "^7.1.0"
-    "@babel/template" "^7.1.0"
-    "@babel/traverse" "^7.1.0"
-    "@babel/types" "^7.0.0"
-
-"@babel/helper-simple-access@^7.1.0":
-  version "7.1.0"
-  resolved "https://registry.yarnpkg.com/@babel/helper-simple-access/-/helper-simple-access-7.1.0.tgz#65eeb954c8c245beaa4e859da6188f39d71e585c"
-  integrity sha512-Vk+78hNjRbsiu49zAPALxTb+JUQCz1aolpd8osOF16BGnLtseD21nbHgLPGUwrXEurZgiCOUmvs3ExTu4F5x6w==
-  dependencies:
-    "@babel/template" "^7.1.0"
-    "@babel/types" "^7.0.0"
-
-"@babel/helper-split-export-declaration@^7.4.4":
-  version "7.4.4"
-  resolved "https://registry.yarnpkg.com/@babel/helper-split-export-declaration/-/helper-split-export-declaration-7.4.4.tgz#ff94894a340be78f53f06af038b205c49d993677"
-  integrity sha512-Ro/XkzLf3JFITkW6b+hNxzZ1n5OQ80NvIUdmHspih1XAhtN3vPTuUFT4eQnela+2MaZ5ulH+iyP513KJrxbN7Q==
-  dependencies:
-    "@babel/types" "^7.4.4"
-
-"@babel/helper-wrap-function@^7.1.0":
-  version "7.2.0"
-  resolved "https://registry.yarnpkg.com/@babel/helper-wrap-function/-/helper-wrap-function-7.2.0.tgz#c4e0012445769e2815b55296ead43a958549f6fa"
-  integrity sha512-o9fP1BZLLSrYlxYEYyl2aS+Flun5gtjTIG8iln+XuEzQTs0PLagAGSXUcqruJwD5fM48jzIEggCKpIfWTcR7pQ==
-  dependencies:
-    "@babel/helper-function-name" "^7.1.0"
-    "@babel/template" "^7.1.0"
-    "@babel/traverse" "^7.1.0"
-    "@babel/types" "^7.2.0"
-
-"@babel/helpers@^7.5.5":
-  version "7.5.5"
-  resolved "https://registry.yarnpkg.com/@babel/helpers/-/helpers-7.5.5.tgz#63908d2a73942229d1e6685bc2a0e730dde3b75e"
-  integrity sha512-nRq2BUhxZFnfEn/ciJuhklHvFOqjJUD5wpx+1bxUF2axL9C+v4DE/dmp5sT2dKnpOs4orZWzpAZqlCy8QqE/7g==
-  dependencies:
-    "@babel/template" "^7.4.4"
-    "@babel/traverse" "^7.5.5"
-    "@babel/types" "^7.5.5"
-
-"@babel/highlight@^7.0.0":
-  version "7.5.0"
-  resolved "https://registry.yarnpkg.com/@babel/highlight/-/highlight-7.5.0.tgz#56d11312bd9248fa619591d02472be6e8cb32540"
-  integrity sha512-7dV4eu9gBxoM0dAnj/BCFDW9LFU0zvTrkq0ugM7pnHEgguOEeOz1so2ZghEdzviYzQEED0r4EAgpsBChKy1TRQ==
-  dependencies:
-    chalk "^2.0.0"
-    esutils "^2.0.2"
-    js-tokens "^4.0.0"
-
-"@babel/parser@^7.0.0", "@babel/parser@^7.4.4", "@babel/parser@^7.5.5":
-  version "7.5.5"
-  resolved "https://registry.yarnpkg.com/@babel/parser/-/parser-7.5.5.tgz#02f077ac8817d3df4a832ef59de67565e71cca4b"
-  integrity sha512-E5BN68cqR7dhKan1SfqgPGhQ178bkVKpXTPEXnFJBrEt8/DKRZlybmy+IgYLTeN7tp1R5Ccmbm2rBk17sHYU3g==
-
-"@babel/plugin-proposal-async-generator-functions@^7.2.0":
-  version "7.2.0"
-  resolved "https://registry.yarnpkg.com/@babel/plugin-proposal-async-generator-functions/-/plugin-proposal-async-generator-functions-7.2.0.tgz#b289b306669dce4ad20b0252889a15768c9d417e"
-  integrity sha512-+Dfo/SCQqrwx48ptLVGLdE39YtWRuKc/Y9I5Fy0P1DDBB9lsAHpjcEJQt+4IifuSOSTLBKJObJqMvaO1pIE8LQ==
-  dependencies:
-    "@babel/helper-plugin-utils" "^7.0.0"
-    "@babel/helper-remap-async-to-generator" "^7.1.0"
-    "@babel/plugin-syntax-async-generators" "^7.2.0"
-
-"@babel/plugin-proposal-dynamic-import@^7.5.0":
-  version "7.5.0"
-  resolved "https://registry.yarnpkg.com/@babel/plugin-proposal-dynamic-import/-/plugin-proposal-dynamic-import-7.5.0.tgz#e532202db4838723691b10a67b8ce509e397c506"
-  integrity sha512-x/iMjggsKTFHYC6g11PL7Qy58IK8H5zqfm9e6hu4z1iH2IRyAp9u9dL80zA6R76yFovETFLKz2VJIC2iIPBuFw==
-  dependencies:
-    "@babel/helper-plugin-utils" "^7.0.0"
-    "@babel/plugin-syntax-dynamic-import" "^7.2.0"
-
-"@babel/plugin-proposal-optional-catch-binding@^7.2.0":
-  version "7.2.0"
-  resolved "https://registry.yarnpkg.com/@babel/plugin-proposal-optional-catch-binding/-/plugin-proposal-optional-catch-binding-7.2.0.tgz#135d81edb68a081e55e56ec48541ece8065c38f5"
-  integrity sha512-mgYj3jCcxug6KUcX4OBoOJz3CMrwRfQELPQ5560F70YQUBZB7uac9fqaWamKR1iWUzGiK2t0ygzjTScZnVz75g==
-  dependencies:
-    "@babel/helper-plugin-utils" "^7.0.0"
-    "@babel/plugin-syntax-optional-catch-binding" "^7.2.0"
-
-"@babel/plugin-syntax-async-generators@^7.2.0":
-  version "7.2.0"
-  resolved "https://registry.yarnpkg.com/@babel/plugin-syntax-async-generators/-/plugin-syntax-async-generators-7.2.0.tgz#69e1f0db34c6f5a0cf7e2b3323bf159a76c8cb7f"
-  integrity sha512-1ZrIRBv2t0GSlcwVoQ6VgSLpLgiN/FVQUzt9znxo7v2Ov4jJrs8RY8tv0wvDmFN3qIdMKWrmMMW6yZ0G19MfGg==
-  dependencies:
-    "@babel/helper-plugin-utils" "^7.0.0"
-
-"@babel/plugin-syntax-dynamic-import@^7.2.0":
-  version "7.2.0"
-  resolved "https://registry.yarnpkg.com/@babel/plugin-syntax-dynamic-import/-/plugin-syntax-dynamic-import-7.2.0.tgz#69c159ffaf4998122161ad8ebc5e6d1f55df8612"
-  integrity sha512-mVxuJ0YroI/h/tbFTPGZR8cv6ai+STMKNBq0f8hFxsxWjl94qqhsb+wXbpNMDPU3cfR1TIsVFzU3nXyZMqyK4w==
-  dependencies:
-    "@babel/helper-plugin-utils" "^7.0.0"
-
-"@babel/plugin-syntax-optional-catch-binding@^7.2.0":
-  version "7.2.0"
-  resolved "https://registry.yarnpkg.com/@babel/plugin-syntax-optional-catch-binding/-/plugin-syntax-optional-catch-binding-7.2.0.tgz#a94013d6eda8908dfe6a477e7f9eda85656ecf5c"
-  integrity sha512-bDe4xKNhb0LI7IvZHiA13kff0KEfaGX/Hv4lMA9+7TEc63hMNvfKo6ZFpXhKuEp+II/q35Gc4NoMeDZyaUbj9w==
-  dependencies:
-    "@babel/helper-plugin-utils" "^7.0.0"
-
-"@babel/plugin-transform-dotall-regex@^7.4.4":
-  version "7.4.4"
-  resolved "https://registry.yarnpkg.com/@babel/plugin-transform-dotall-regex/-/plugin-transform-dotall-regex-7.4.4.tgz#361a148bc951444312c69446d76ed1ea8e4450c3"
-  integrity sha512-P05YEhRc2h53lZDjRPk/OektxCVevFzZs2Gfjd545Wde3k+yFDbXORgl2e0xpbq8mLcKJ7Idss4fAg0zORN/zg==
-  dependencies:
-    "@babel/helper-plugin-utils" "^7.0.0"
-    "@babel/helper-regex" "^7.4.4"
-    regexpu-core "^4.5.4"
-
-"@babel/plugin-transform-modules-commonjs@^7.5.0":
-  version "7.5.0"
-  resolved "https://registry.yarnpkg.com/@babel/plugin-transform-modules-commonjs/-/plugin-transform-modules-commonjs-7.5.0.tgz#425127e6045231360858eeaa47a71d75eded7a74"
-  integrity sha512-xmHq0B+ytyrWJvQTc5OWAC4ii6Dhr0s22STOoydokG51JjWhyYo5mRPXoi+ZmtHQhZZwuXNN+GG5jy5UZZJxIQ==
-  dependencies:
-    "@babel/helper-module-transforms" "^7.4.4"
-    "@babel/helper-plugin-utils" "^7.0.0"
-    "@babel/helper-simple-access" "^7.1.0"
-    babel-plugin-dynamic-import-node "^2.3.0"
-
-"@babel/template@^7.1.0", "@babel/template@^7.4.4":
-  version "7.4.4"
-  resolved "https://registry.yarnpkg.com/@babel/template/-/template-7.4.4.tgz#f4b88d1225689a08f5bc3a17483545be9e4ed237"
-  integrity sha512-CiGzLN9KgAvgZsnivND7rkA+AeJ9JB0ciPOD4U59GKbQP2iQl+olF1l76kJOupqidozfZ32ghwBEJDhnk9MEcw==
-  dependencies:
-    "@babel/code-frame" "^7.0.0"
-    "@babel/parser" "^7.4.4"
-    "@babel/types" "^7.4.4"
-
-"@babel/traverse@^7.1.0", "@babel/traverse@^7.5.5":
-  version "7.5.5"
-  resolved "https://registry.yarnpkg.com/@babel/traverse/-/traverse-7.5.5.tgz#f664f8f368ed32988cd648da9f72d5ca70f165bb"
-  integrity sha512-MqB0782whsfffYfSjH4TM+LMjrJnhCNEDMDIjeTpl+ASaUvxcjoiVCo/sM1GhS1pHOXYfWVCYneLjMckuUxDaQ==
-  dependencies:
-    "@babel/code-frame" "^7.5.5"
-    "@babel/generator" "^7.5.5"
-    "@babel/helper-function-name" "^7.1.0"
-    "@babel/helper-split-export-declaration" "^7.4.4"
-    "@babel/parser" "^7.5.5"
-    "@babel/types" "^7.5.5"
-    debug "^4.1.0"
-    globals "^11.1.0"
-    lodash "^4.17.13"
-
-"@babel/types@^7.0.0", "@babel/types@^7.2.0", "@babel/types@^7.4.4", "@babel/types@^7.5.5":
-  version "7.5.5"
-  resolved "https://registry.yarnpkg.com/@babel/types/-/types-7.5.5.tgz#97b9f728e182785909aa4ab56264f090a028d18a"
-  integrity sha512-s63F9nJioLqOlW3UkyMd+BYhXt44YuaFm/VV0VwuteqjYwRrObkU7ra9pY4wAJR3oXi8hJrMcrcJdO/HH33vtw==
-  dependencies:
-    esutils "^2.0.2"
-    lodash "^4.17.13"
-    to-fast-properties "^2.0.0"
-
-"@concordance/react@^2.0.0":
-  version "2.0.0"
-  resolved "https://registry.yarnpkg.com/@concordance/react/-/react-2.0.0.tgz#aef913f27474c53731f4fd79cc2f54897de90fde"
-  integrity sha512-huLSkUuM2/P+U0uy2WwlKuixMsTODD8p4JVQBI4VKeopkiN0C7M3N9XYVawb4M+4spN5RrO/eLhk7KoQX6nsfA==
-  dependencies:
-    arrify "^1.0.1"
-
-"@nodelib/fs.scandir@2.1.1":
-  version "2.1.1"
-  resolved "https://registry.yarnpkg.com/@nodelib/fs.scandir/-/fs.scandir-2.1.1.tgz#7fa8fed654939e1a39753d286b48b4836d00e0eb"
-  integrity sha512-NT/skIZjgotDSiXs0WqYhgcuBKhUMgfekCmCGtkUAiLqZdOnrdjmZr9wRl3ll64J9NF79uZ4fk16Dx0yMc/Xbg==
-  dependencies:
-    "@nodelib/fs.stat" "2.0.1"
-    run-parallel "^1.1.9"
-
-"@nodelib/fs.stat@2.0.1", "@nodelib/fs.stat@^2.0.1":
-  version "2.0.1"
-  resolved "https://registry.yarnpkg.com/@nodelib/fs.stat/-/fs.stat-2.0.1.tgz#814f71b1167390cfcb6a6b3d9cdeb0951a192c14"
-  integrity sha512-+RqhBlLn6YRBGOIoVYthsG0J9dfpO79eJyN7BYBkZJtfqrBwf2KK+rD/M/yjZR6WBmIhAgOV7S60eCgaSWtbFw==
-
-"@nodelib/fs.walk@^1.2.1":
-  version "1.2.2"
-  resolved "https://registry.yarnpkg.com/@nodelib/fs.walk/-/fs.walk-1.2.2.tgz#6a6450c5e17012abd81450eb74949a4d970d2807"
-  integrity sha512-J/DR3+W12uCzAJkw7niXDcqcKBg6+5G5Q/ZpThpGNzAUz70eOR6RV4XnnSN01qHZiVl0eavoxJsBypQoKsV2QQ==
-  dependencies:
-    "@nodelib/fs.scandir" "2.1.1"
-    fastq "^1.6.0"
-
-"@sindresorhus/is@^0.14.0":
-  version "0.14.0"
-  resolved "https://registry.yarnpkg.com/@sindresorhus/is/-/is-0.14.0.tgz#9fb3a3cf3132328151f353de4632e01e52102bea"
-  integrity sha512-9NET910DNaIPngYnLLPeg+Ogzqsi9uM4mSboU5y6p8S5DzMTVEsJZrawi+BoDNUVBa2DhJqQYUFvMDfgU062LQ==
-
-"@szmarczak/http-timer@^1.1.2":
-  version "1.1.2"
-  resolved "https://registry.yarnpkg.com/@szmarczak/http-timer/-/http-timer-1.1.2.tgz#b1665e2c461a2cd92f4c1bbf50d5454de0d4b421"
-  integrity sha512-XIB2XbzHTN6ieIjfIMV9hlVcfPU26s2vafYWQcZHWXHOxiaRZYEDKEwdl129Zyg50+foYV2jCgtrqSA6qNuNSA==
-  dependencies:
-    defer-to-connect "^1.0.1"
-
-"@types/events@*":
-  version "3.0.0"
-  resolved "https://registry.yarnpkg.com/@types/events/-/events-3.0.0.tgz#2862f3f58a9a7f7c3e78d79f130dd4d71c25c2a7"
-  integrity sha512-EaObqwIvayI5a8dCzhFrjKzVwKLxjoG9T6Ppd5CEo07LRKfQ8Yokw54r5+Wq7FaBQ+yXRvQAYPrHwya1/UFt9g==
-
-"@types/glob@^7.1.1":
-  version "7.1.1"
-  resolved "https://registry.yarnpkg.com/@types/glob/-/glob-7.1.1.tgz#aa59a1c6e3fbc421e07ccd31a944c30eba521575"
-  integrity sha512-1Bh06cbWJUHMC97acuD6UMG29nMt0Aqz1vF3guLfG+kHHJhy3AyohZFFxYk2f7Q1SQIrNwvncxAE0N/9s70F2w==
-  dependencies:
-    "@types/events" "*"
-    "@types/minimatch" "*"
-    "@types/node" "*"
-
-"@types/minimatch@*":
-  version "3.0.3"
-  resolved "https://registry.yarnpkg.com/@types/minimatch/-/minimatch-3.0.3.tgz#3dca0e3f33b200fc7d1139c0cd96c1268cadfd9d"
-  integrity sha512-tHq6qdbT9U1IRSGf14CL0pUlULksvY9OZ+5eEgl1N7t+OA3tGvNpxJCzuKQlsNgCVwbAs670L1vcVQi8j9HjnA==
-
-"@types/node@*":
-  version "12.7.2"
-  resolved "https://registry.yarnpkg.com/@types/node/-/node-12.7.2.tgz#c4e63af5e8823ce9cc3f0b34f7b998c2171f0c44"
-  integrity sha512-dyYO+f6ihZEtNPDcWNR1fkoTDf3zAK3lAABDze3mz6POyIercH0lEUawUFXlG8xaQZmm1yEBON/4TsYv/laDYg==
-
-ansi-align@^3.0.0:
-  version "3.0.0"
-  resolved "https://registry.yarnpkg.com/ansi-align/-/ansi-align-3.0.0.tgz#b536b371cf687caaef236c18d3e21fe3797467cb"
-  integrity sha512-ZpClVKqXN3RGBmKibdfWzqCY4lnjEuoNzU5T0oEFpfd/z5qJHVarukridD4juLO2FXMiwUQxr9WqQtaYa8XRYw==
-  dependencies:
-    string-width "^3.0.0"
-
-ansi-escapes@^4.2.1:
-  version "4.2.1"
-  resolved "https://registry.yarnpkg.com/ansi-escapes/-/ansi-escapes-4.2.1.tgz#4dccdb846c3eee10f6d64dea66273eab90c37228"
-  integrity sha512-Cg3ymMAdN10wOk/VYfLV7KCQyv7EDirJ64500sU7n9UlmioEtDuU5Gd+hj73hXSU/ex7tHJSssmyftDdkMLO8Q==
-  dependencies:
-    type-fest "^0.5.2"
-
-ansi-regex@^3.0.0:
-  version "3.0.0"
-  resolved "https://registry.yarnpkg.com/ansi-regex/-/ansi-regex-3.0.0.tgz#ed0317c322064f79466c02966bddb605ab37d998"
-  integrity sha1-7QMXwyIGT3lGbAKWa922Bas32Zg=
-
-ansi-regex@^4.1.0:
-  version "4.1.0"
-  resolved "https://registry.yarnpkg.com/ansi-regex/-/ansi-regex-4.1.0.tgz#8b9f8f08cf1acb843756a839ca8c7e3168c51997"
-  integrity sha512-1apePfXM1UOSqw0o9IiFAovVz9M5S1Dg+4TrDwfMewQ6p/rmMueb7tWZjQ1rx4Loy1ArBggoqGpfqqdI4rondg==
-
-ansi-styles@^3.2.0, ansi-styles@^3.2.1:
-  version "3.2.1"
-  resolved "https://registry.yarnpkg.com/ansi-styles/-/ansi-styles-3.2.1.tgz#41fbb20243e50b12be0f04b8dedbf07520ce841d"
-  integrity sha512-VT0ZI6kZRdTh8YyJw3SMbYm/u+NqfsAxEpWO0Pf9sq8/e94WxxOpPKx9FR1FlyCtOVDNOQ+8ntlqFxiRc+r5qA==
-  dependencies:
-    color-convert "^1.9.0"
-
-ansi-styles@^4.0.0:
-  version "4.0.0"
-  resolved "https://registry.yarnpkg.com/ansi-styles/-/ansi-styles-4.0.0.tgz#f6b84e8fc97ea7add7a53b7530ef28f3fde0e048"
-  integrity sha512-8zjUtFJ3db/QoPXuuEMloS2AUf79/yeyttJ7Abr3hteopJu9HK8vsgGviGUMq+zyA6cZZO6gAyZoMTF6TgaEjA==
-  dependencies:
-    color-convert "^2.0.0"
-
-anymatch@^3.0.1:
-  version "3.0.3"
-  resolved "https://registry.yarnpkg.com/anymatch/-/anymatch-3.0.3.tgz#2fb624fe0e84bccab00afee3d0006ed310f22f09"
-  integrity sha512-c6IvoeBECQlMVuYUjSwimnhmztImpErfxJzWZhIQinIvQWoGOnB0dLIgifbPHQt5heS6mNlaZG16f06H3C8t1g==
-  dependencies:
-    normalize-path "^3.0.0"
-    picomatch "^2.0.4"
-
-argparse@^1.0.7:
-  version "1.0.10"
-  resolved "https://registry.yarnpkg.com/argparse/-/argparse-1.0.10.tgz#bcd6791ea5ae09725e17e5ad988134cd40b3d911"
-  integrity sha512-o5Roy6tNG4SL/FOkCAN6RzjiakZS25RLYFrcMttJqbdd8BWrnA+fGz57iN5Pb06pvBGvl5gQ0B48dJlslXvoTg==
-  dependencies:
-    sprintf-js "~1.0.2"
-
-arr-flatten@^1.1.0:
-  version "1.1.0"
-  resolved "https://registry.yarnpkg.com/arr-flatten/-/arr-flatten-1.1.0.tgz#36048bbff4e7b47e136644316c99669ea5ae91f1"
-  integrity sha512-L3hKV5R/p5o81R7O02IGnwpDmkp6E982XhtbuwSe3O4qOtMMMtodicASA1Cny2U+aCXcNpml+m4dPsvsJ3jatg==
-
-array-find-index@^1.0.1:
-  version "1.0.2"
-  resolved "https://registry.yarnpkg.com/array-find-index/-/array-find-index-1.0.2.tgz#df010aa1287e164bbda6f9723b0a96a1ec4187a1"
-  integrity sha1-3wEKoSh+Fku9pvlyOwqWoexBh6E=
-
-array-union@^1.0.1:
-  version "1.0.2"
-  resolved "https://registry.yarnpkg.com/array-union/-/array-union-1.0.2.tgz#9a34410e4f4e3da23dea375be5be70f24778ec39"
-  integrity sha1-mjRBDk9OPaI96jdb5b5w8kd47Dk=
-  dependencies:
-    array-uniq "^1.0.1"
-
-array-union@^2.1.0:
-  version "2.1.0"
-  resolved "https://registry.yarnpkg.com/array-union/-/array-union-2.1.0.tgz#b798420adbeb1de828d84acd8a2e23d3efe85e8d"
-  integrity sha512-HGyxoOTYUyCM6stUe6EJgnd4EoewAI7zMdfqO+kGjnlZmBDz/cR5pf8r/cR4Wq60sL/p0IkcjUEEPwS3GFrIyw==
-
-array-uniq@^1.0.1:
-  version "1.0.3"
-  resolved "https://registry.yarnpkg.com/array-uniq/-/array-uniq-1.0.3.tgz#af6ac877a25cc7f74e058894753858dfdb24fdb6"
-  integrity sha1-r2rId6Jcx/dOBYiUdThY39sk/bY=
-
-array-uniq@^2.1.0:
-  version "2.1.0"
-  resolved "https://registry.yarnpkg.com/array-uniq/-/array-uniq-2.1.0.tgz#46603d5e28e79bfd02b046fcc1d77c6820bd8e98"
-  integrity sha512-bdHxtev7FN6+MXI1YFW0Q8mQ8dTJc2S8AMfju+ZR77pbg2yAdVyDlwkaUI7Har0LyOMRFPHrJ9lYdyjZZswdlQ==
-
-arrify@^1.0.1:
-  version "1.0.1"
-  resolved "https://registry.yarnpkg.com/arrify/-/arrify-1.0.1.tgz#898508da2226f380df904728456849c1501a4b0d"
-  integrity sha1-iYUI2iIm84DfkEcoRWhJwVAaSw0=
-
-arrify@^2.0.1:
-  version "2.0.1"
-  resolved "https://registry.yarnpkg.com/arrify/-/arrify-2.0.1.tgz#c9655e9331e0abcd588d2a7cad7e9956f66701fa"
-  integrity sha512-3duEwti880xqi4eAMN8AyR4a0ByT90zoYdLlevfrvU43vb0YZwZVfxOgxWrLXXXpyugL0hNZc9G6BiB5B3nUug==
-
-astral-regex@^1.0.0:
-  version "1.0.0"
-  resolved "https://registry.yarnpkg.com/astral-regex/-/astral-regex-1.0.0.tgz#6c8c3fb827dd43ee3918f27b82782ab7658a6fd9"
-  integrity sha512-+Ryf6g3BKoRc7jfp7ad8tM4TtMiaWvbF/1/sQcZPkkS7ag3D5nMBCe2UfOTONtAkaG0tO0ij3C5Lwmf1EiyjHg==
-
-ava@2.3.0:
-  version "2.3.0"
-  resolved "https://registry.yarnpkg.com/ava/-/ava-2.3.0.tgz#cac4d7f0a30077a852c6bf5bc7c0bc78c3021e63"
-  integrity sha512-4VaaSnl13vpTZmqW3aMqioSolT0/ozRkjQxTLi3p8wtyRONuX/uLKL3uF0j50w2BNRoLsJqztnkX2h8xeVp2lg==
-  dependencies:
-    "@ava/babel-preset-stage-4" "^4.0.0"
-    "@ava/babel-preset-transform-test-files" "^6.0.0"
-    "@babel/core" "^7.5.5"
-    "@babel/generator" "^7.5.5"
-    "@concordance/react" "^2.0.0"
-    ansi-escapes "^4.2.1"
-    ansi-styles "^4.0.0"
-    arr-flatten "^1.1.0"
-    array-union "^2.1.0"
-    array-uniq "^2.1.0"
-    arrify "^2.0.1"
-    bluebird "^3.5.5"
-    chalk "^2.4.2"
-    chokidar "^3.0.2"
-    chunkd "^1.0.0"
-    ci-parallel-vars "^1.0.0"
-    clean-stack "^2.2.0"
-    clean-yaml-object "^0.1.0"
-    cli-cursor "^3.1.0"
-    cli-truncate "^2.0.0"
-    code-excerpt "^2.1.1"
-    common-path-prefix "^1.0.0"
-    concordance "^4.0.0"
-    convert-source-map "^1.6.0"
-    currently-unhandled "^0.4.1"
-    debug "^4.1.1"
-    del "^4.1.1"
-    dot-prop "^5.1.0"
-    emittery "^0.4.1"
-    empower-core "^1.2.0"
-    equal-length "^1.0.0"
-    escape-string-regexp "^2.0.0"
-    esm "^3.2.25"
-    figures "^3.0.0"
-    find-up "^4.1.0"
-    get-port "^5.0.0"
-    globby "^10.0.1"
-    ignore-by-default "^1.0.0"
-    import-local "^3.0.2"
-    indent-string "^4.0.0"
-    is-ci "^2.0.0"
-    is-error "^2.2.2"
-    is-observable "^2.0.0"
-    is-plain-object "^3.0.0"
-    is-promise "^2.1.0"
-    lodash "^4.17.15"
-    loud-rejection "^2.1.0"
-    make-dir "^3.0.0"
-    matcher "^2.0.0"
-    md5-hex "^3.0.1"
-    meow "^5.0.0"
-    micromatch "^4.0.2"
-    ms "^2.1.2"
-    observable-to-promise "^1.0.0"
-    ora "^3.4.0"
-    package-hash "^4.0.0"
-    pkg-conf "^3.1.0"
-    plur "^3.1.1"
-    pretty-ms "^5.0.0"
-    require-precompiled "^0.1.0"
-    resolve-cwd "^3.0.0"
-    slash "^3.0.0"
-    source-map-support "^0.5.13"
-    stack-utils "^1.0.2"
-    strip-ansi "^5.2.0"
-    strip-bom-buf "^2.0.0"
-    supertap "^1.0.0"
-    supports-color "^7.0.0"
-    trim-off-newlines "^1.0.1"
-    trim-right "^1.0.1"
-    unique-temp-dir "^1.0.0"
-    update-notifier "^3.0.1"
-    write-file-atomic "^3.0.0"
-
-babel-plugin-dynamic-import-node@^2.3.0:
-  version "2.3.0"
-  resolved "https://registry.yarnpkg.com/babel-plugin-dynamic-import-node/-/babel-plugin-dynamic-import-node-2.3.0.tgz#f00f507bdaa3c3e3ff6e7e5e98d90a7acab96f7f"
-  integrity sha512-o6qFkpeQEBxcqt0XYlWzAVxNCSCZdUgcR8IRlhD/8DylxjjO4foPcvTW0GGKa/cVt3rvxZ7o5ippJ+/0nvLhlQ==
-  dependencies:
-    object.assign "^4.1.0"
-
-babel-plugin-espower@^3.0.1:
-  version "3.0.1"
-  resolved "https://registry.yarnpkg.com/babel-plugin-espower/-/babel-plugin-espower-3.0.1.tgz#180db17126f88e754105b8b5216d21e520a6bd4e"
-  integrity sha512-Ms49U7VIAtQ/TtcqRbD6UBmJBUCSxiC3+zPc+eGqxKUIFO1lTshyEDRUjhoAbd2rWfwYf3cZ62oXozrd8W6J0A==
-  dependencies:
-    "@babel/generator" "^7.0.0"
-    "@babel/parser" "^7.0.0"
-    call-matcher "^1.0.0"
-    core-js "^2.0.0"
-    espower-location-detector "^1.0.0"
-    espurify "^1.6.0"
-    estraverse "^4.1.1"
-
-balanced-match@^1.0.0:
-  version "1.0.0"
-  resolved "https://registry.yarnpkg.com/balanced-match/-/balanced-match-1.0.0.tgz#89b4d199ab2bee49de164ea02b89ce462d71b767"
-  integrity sha1-ibTRmasr7kneFk6gK4nORi1xt2c=
-
-binary-extensions@^2.0.0:
-  version "2.0.0"
-  resolved "https://registry.yarnpkg.com/binary-extensions/-/binary-extensions-2.0.0.tgz#23c0df14f6a88077f5f986c0d167ec03c3d5537c"
-  integrity sha512-Phlt0plgpIIBOGTT/ehfFnbNlfsDEiqmzE2KRXoX1bLIlir4X/MR+zSyBEkL05ffWgnRSf/DXv+WrUAVr93/ow==
-
-bluebird@^3.5.5:
-  version "3.5.5"
-  resolved "https://registry.yarnpkg.com/bluebird/-/bluebird-3.5.5.tgz#a8d0afd73251effbbd5fe384a77d73003c17a71f"
-  integrity sha512-5am6HnnfN+urzt4yfg7IgTbotDjIT/u8AJpEt0sIU9FtXfVeezXAPKswrG+xKUCOYAINpSdgZVDU6QFh+cuH3w==
-
-blueimp-md5@^2.10.0:
-  version "2.11.1"
-  resolved "https://registry.yarnpkg.com/blueimp-md5/-/blueimp-md5-2.11.1.tgz#b1f6b6218d13cdedbf5743f32b3023b2afefcbd3"
-  integrity sha512-4UiOAmql2XO0Sws07OVzYdCKK0K2Va5g6AVgYXoGhEQiKrdSOefjUCm1frPk6E+xiIOHRqaFg+TUGo7cClKg5g==
-
-boxen@^3.0.0:
-  version "3.2.0"
-  resolved "https://registry.yarnpkg.com/boxen/-/boxen-3.2.0.tgz#fbdff0de93636ab4450886b6ff45b92d098f45eb"
-  integrity sha512-cU4J/+NodM3IHdSL2yN8bqYqnmlBTidDR4RC7nJs61ZmtGz8VZzM3HLQX0zY5mrSmPtR3xWwsq2jOUQqFZN8+A==
-  dependencies:
-    ansi-align "^3.0.0"
-    camelcase "^5.3.1"
-    chalk "^2.4.2"
-    cli-boxes "^2.2.0"
-    string-width "^3.0.0"
-    term-size "^1.2.0"
-    type-fest "^0.3.0"
-    widest-line "^2.0.0"
-
-brace-expansion@^1.1.7:
-  version "1.1.11"
-  resolved "https://registry.yarnpkg.com/brace-expansion/-/brace-expansion-1.1.11.tgz#3c7fcbf529d87226f3d2f52b966ff5271eb441dd"
-  integrity sha512-iCuPHDFgrHX7H2vEI/5xpz07zSHB00TpugqhmYtVmMO6518mCuRMoOYFldEBl0g187ufozdaHgWKcYFb61qGiA==
-  dependencies:
-    balanced-match "^1.0.0"
-    concat-map "0.0.1"
-
-braces@^3.0.1, braces@^3.0.2:
-  version "3.0.2"
-  resolved "https://registry.yarnpkg.com/braces/-/braces-3.0.2.tgz#3454e1a462ee8d599e236df336cd9ea4f8afe107"
-  integrity sha512-b8um+L1RzM3WDSzvhm6gIz1yfTbBt6YTlcEKAvsmqCZZFw46z626lVj9j1yEPW33H5H+lBQpZMP1k8l+78Ha0A==
-  dependencies:
-    fill-range "^7.0.1"
-
-buffer-from@^1.0.0:
-  version "1.1.1"
-  resolved "https://registry.yarnpkg.com/buffer-from/-/buffer-from-1.1.1.tgz#32713bc028f75c02fdb710d7c7bcec1f2c6070ef"
-  integrity sha512-MQcXEUbCKtEo7bhqEs6560Hyd4XaovZlO/k9V3hjVUF/zwW7KBVdSK4gIt/bzwS9MbR5qob+F5jusZsb0YQK2A==
-
-cacheable-request@^6.0.0:
-  version "6.1.0"
-  resolved "https://registry.yarnpkg.com/cacheable-request/-/cacheable-request-6.1.0.tgz#20ffb8bd162ba4be11e9567d823db651052ca912"
-  integrity sha512-Oj3cAGPCqOZX7Rz64Uny2GYAZNliQSqfbePrgAQ1wKAihYmCUnraBtJtKcGR4xz7wF+LoJC+ssFZvv5BgF9Igg==
-  dependencies:
-    clone-response "^1.0.2"
-    get-stream "^5.1.0"
-    http-cache-semantics "^4.0.0"
-    keyv "^3.0.0"
-    lowercase-keys "^2.0.0"
-    normalize-url "^4.1.0"
-    responselike "^1.0.2"
-
-call-matcher@^1.0.0:
-  version "1.1.0"
-  resolved "https://registry.yarnpkg.com/call-matcher/-/call-matcher-1.1.0.tgz#23b2c1bc7a8394c8be28609d77ddbd5786680432"
-  integrity sha512-IoQLeNwwf9KTNbtSA7aEBb1yfDbdnzwjCetjkC8io5oGeOmK2CBNdg0xr+tadRYKO0p7uQyZzvon0kXlZbvGrw==
-  dependencies:
-    core-js "^2.0.0"
-    deep-equal "^1.0.0"
-    espurify "^1.6.0"
-    estraverse "^4.0.0"
-
-call-signature@0.0.2:
-  version "0.0.2"
-  resolved "https://registry.yarnpkg.com/call-signature/-/call-signature-0.0.2.tgz#a84abc825a55ef4cb2b028bd74e205a65b9a4996"
-  integrity sha1-qEq8glpV70yysCi9dOIFpluaSZY=
-
-camelcase-keys@^4.0.0:
-  version "4.2.0"
-  resolved "https://registry.yarnpkg.com/camelcase-keys/-/camelcase-keys-4.2.0.tgz#a2aa5fb1af688758259c32c141426d78923b9b77"
-  integrity sha1-oqpfsa9oh1glnDLBQUJteJI7m3c=
-  dependencies:
-    camelcase "^4.1.0"
-    map-obj "^2.0.0"
-    quick-lru "^1.0.0"
-
-camelcase@^4.1.0:
-  version "4.1.0"
-  resolved "https://registry.yarnpkg.com/camelcase/-/camelcase-4.1.0.tgz#d545635be1e33c542649c69173e5de6acfae34dd"
-  integrity sha1-1UVjW+HjPFQmScaRc+Xeas+uNN0=
-
-camelcase@^5.3.1:
-  version "5.3.1"
-  resolved "https://registry.yarnpkg.com/camelcase/-/camelcase-5.3.1.tgz#e3c9b31569e106811df242f715725a1f4c494320"
-  integrity sha512-L28STB170nwWS63UjtlEOE3dldQApaJXZkOI1uMFfzf3rRuPegHaHesyee+YxQ+W6SvRDQV6UrdOdRiR153wJg==
-
-chalk@^2.0.0, chalk@^2.0.1, chalk@^2.4.2:
-  version "2.4.2"
-  resolved "https://registry.yarnpkg.com/chalk/-/chalk-2.4.2.tgz#cd42541677a54333cf541a49108c1432b44c9424"
-  integrity sha512-Mti+f9lpJNcwF4tWV8/OrTTtF1gZi+f8FqlyAdouralcFWFQWF2+NgCHShjkCb+IFBLq9buZwE1xckQU4peSuQ==
-  dependencies:
-    ansi-styles "^3.2.1"
-    escape-string-regexp "^1.0.5"
-    supports-color "^5.3.0"
-
-chokidar@^3.0.2:
-  version "3.0.2"
-  resolved "https://registry.yarnpkg.com/chokidar/-/chokidar-3.0.2.tgz#0d1cd6d04eb2df0327446188cd13736a3367d681"
-  integrity sha512-c4PR2egjNjI1um6bamCQ6bUNPDiyofNQruHvKgHQ4gDUP/ITSVSzNsiI5OWtHOsX323i5ha/kk4YmOZ1Ktg7KA==
-  dependencies:
-    anymatch "^3.0.1"
-    braces "^3.0.2"
-    glob-parent "^5.0.0"
-    is-binary-path "^2.1.0"
-    is-glob "^4.0.1"
-    normalize-path "^3.0.0"
-    readdirp "^3.1.1"
-  optionalDependencies:
-    fsevents "^2.0.6"
-
-chunkd@^1.0.0:
-  version "1.0.0"
-  resolved "https://registry.yarnpkg.com/chunkd/-/chunkd-1.0.0.tgz#4ead4a3704bcce510c4bb4d4a8be30c557836dd1"
-  integrity sha512-xx3Pb5VF9QaqCotolyZ1ywFBgyuJmu6+9dLiqBxgelEse9Xsr3yUlpoX3O4Oh11M00GT2kYMsRByTKIMJW2Lkg==
-
-ci-info@^2.0.0:
-  version "2.0.0"
-  resolved "https://registry.yarnpkg.com/ci-info/-/ci-info-2.0.0.tgz#67a9e964be31a51e15e5010d58e6f12834002f46"
-  integrity sha512-5tK7EtrZ0N+OLFMthtqOj4fI2Jeb88C4CAZPu25LDVUgXJ0A3Js4PMGqrn0JU1W0Mh1/Z8wZzYPxqUrXeBboCQ==
-
-ci-parallel-vars@^1.0.0:
-  version "1.0.0"
-  resolved "https://registry.yarnpkg.com/ci-parallel-vars/-/ci-parallel-vars-1.0.0.tgz#af97729ed1c7381911ca37bcea263d62638701b3"
-  integrity sha512-u6dx20FBXm+apMi+5x7UVm6EH7BL1gc4XrcnQewjcB7HWRcor/V5qWc3RG2HwpgDJ26gIi2DSEu3B7sXynAw/g==
-
-clean-stack@^2.2.0:
-  version "2.2.0"
-  resolved "https://registry.yarnpkg.com/clean-stack/-/clean-stack-2.2.0.tgz#ee8472dbb129e727b31e8a10a427dee9dfe4008b"
-  integrity sha512-4diC9HaTE+KRAMWhDhrGOECgWZxoevMc5TlkObMqNSsVU62PYzXZ/SMTjzyGAFF1YusgxGcSWTEXBhp0CPwQ1A==
-
-clean-yaml-object@^0.1.0:
-  version "0.1.0"
-  resolved "https://registry.yarnpkg.com/clean-yaml-object/-/clean-yaml-object-0.1.0.tgz#63fb110dc2ce1a84dc21f6d9334876d010ae8b68"
-  integrity sha1-Y/sRDcLOGoTcIfbZM0h20BCui2g=
-
-cli-boxes@^2.2.0:
-  version "2.2.0"
-  resolved "https://registry.yarnpkg.com/cli-boxes/-/cli-boxes-2.2.0.tgz#538ecae8f9c6ca508e3c3c95b453fe93cb4c168d"
-  integrity sha512-gpaBrMAizVEANOpfZp/EEUixTXDyGt7DFzdK5hU+UbWt/J0lB0w20ncZj59Z9a93xHb9u12zF5BS6i9RKbtg4w==
-
-cli-cursor@^2.1.0:
-  version "2.1.0"
-  resolved "https://registry.yarnpkg.com/cli-cursor/-/cli-cursor-2.1.0.tgz#b35dac376479facc3e94747d41d0d0f5238ffcb5"
-  integrity sha1-s12sN2R5+sw+lHR9QdDQ9SOP/LU=
-  dependencies:
-    restore-cursor "^2.0.0"
-
-cli-cursor@^3.1.0:
-  version "3.1.0"
-  resolved "https://registry.yarnpkg.com/cli-cursor/-/cli-cursor-3.1.0.tgz#264305a7ae490d1d03bf0c9ba7c925d1753af307"
-  integrity sha512-I/zHAwsKf9FqGoXM4WWRACob9+SNukZTd94DWF57E4toouRulbCxcUh6RKUEOQlYTHJnzkPMySvPNaaSLNfLZw==
-  dependencies:
-    restore-cursor "^3.1.0"
-
-cli-spinners@^2.0.0:
-  version "2.2.0"
-  resolved "https://registry.yarnpkg.com/cli-spinners/-/cli-spinners-2.2.0.tgz#e8b988d9206c692302d8ee834e7a85c0144d8f77"
-  integrity sha512-tgU3fKwzYjiLEQgPMD9Jt+JjHVL9kW93FiIMX/l7rivvOD4/LL0Mf7gda3+4U2KJBloybwgj5KEoQgGRioMiKQ==
-
-cli-truncate@^2.0.0:
-  version "2.0.0"
-  resolved "https://registry.yarnpkg.com/cli-truncate/-/cli-truncate-2.0.0.tgz#68ff6aaa53b203b52ad89b8b1a80f1f61ad1e1d5"
-  integrity sha512-C4hp+8GCIFVsUUiXcw+ce+7wexVWImw8rQrgMBFsqerx9LvvcGlwm6sMjQYAEmV/Xb87xc1b5Ttx505MSpZVqg==
-  dependencies:
-    slice-ansi "^2.1.0"
-    string-width "^4.1.0"
-
-clone-response@^1.0.2:
-  version "1.0.2"
-  resolved "https://registry.yarnpkg.com/clone-response/-/clone-response-1.0.2.tgz#d1dc973920314df67fbeb94223b4ee350239e96b"
-  integrity sha1-0dyXOSAxTfZ/vrlCI7TuNQI56Ws=
-  dependencies:
-    mimic-response "^1.0.0"
-
-clone@^1.0.2:
-  version "1.0.4"
-  resolved "https://registry.yarnpkg.com/clone/-/clone-1.0.4.tgz#da309cc263df15994c688ca902179ca3c7cd7c7e"
-  integrity sha1-2jCcwmPfFZlMaIypAheco8fNfH4=
-
-code-excerpt@^2.1.1:
-  version "2.1.1"
-  resolved "https://registry.yarnpkg.com/code-excerpt/-/code-excerpt-2.1.1.tgz#5fe3057bfbb71a5f300f659ef2cc0a47651ba77c"
-  integrity sha512-tJLhH3EpFm/1x7heIW0hemXJTUU5EWl2V0EIX558jp05Mt1U6DVryCgkp3l37cxqs+DNbNgxG43SkwJXpQ14Jw==
-  dependencies:
-    convert-to-spaces "^1.0.1"
-
-color-convert@^1.9.0:
-  version "1.9.3"
-  resolved "https://registry.yarnpkg.com/color-convert/-/color-convert-1.9.3.tgz#bb71850690e1f136567de629d2d5471deda4c1e8"
-  integrity sha512-QfAUtd+vFdAtFQcC8CCyYt1fYWxSqAiK2cSD6zDB8N3cpsEBAvRxp9zOGg6G/SHHJYAT88/az/IuDGALsNVbGg==
-  dependencies:
-    color-name "1.1.3"
-
-color-convert@^2.0.0:
-  version "2.0.0"
-  resolved "https://registry.yarnpkg.com/color-convert/-/color-convert-2.0.0.tgz#9851ac61cc0d3898a8a3088650d5bf447bf69d97"
-  integrity sha512-hzTicsCJIHdxih9+2aLR1tNGZX5qSJGRHDPVwSY26tVrEf55XNajLOBWz2UuWSIergszA09/bqnOiHyqx9fxQg==
-  dependencies:
-    color-name "~1.1.4"
-
-color-name@1.1.3:
-  version "1.1.3"
-  resolved "https://registry.yarnpkg.com/color-name/-/color-name-1.1.3.tgz#a7d0558bd89c42f795dd42328f740831ca53bc25"
-  integrity sha1-p9BVi9icQveV3UIyj3QIMcpTvCU=
-
-color-name@~1.1.4:
-  version "1.1.4"
-  resolved "https://registry.yarnpkg.com/color-name/-/color-name-1.1.4.tgz#c2a09a87acbde69543de6f63fa3995c826c536a2"
-  integrity sha512-dOy+3AuW3a2wNbZHIuMZpTcgjGuLU/uBL/ubcZF9OXbDo8ff4O8yVp5Bf0efS8uEoYo5q4Fx7dY9OgQGXgAsQA==
-
-common-path-prefix@^1.0.0:
-  version "1.0.0"
-  resolved "https://registry.yarnpkg.com/common-path-prefix/-/common-path-prefix-1.0.0.tgz#cd52f6f0712e0baab97d6f9732874f22f47752c0"
-  integrity sha1-zVL28HEuC6q5fW+XModPIvR3UsA=
-
-concat-map@0.0.1:
-  version "0.0.1"
-  resolved "https://registry.yarnpkg.com/concat-map/-/concat-map-0.0.1.tgz#d8a96bd77fd68df7793a73036a3ba0d5405d477b"
-  integrity sha1-2Klr13/Wjfd5OnMDajug1UBdR3s=
-
-concordance@^4.0.0:
-  version "4.0.0"
-  resolved "https://registry.yarnpkg.com/concordance/-/concordance-4.0.0.tgz#5932fdee397d129bdbc3a1885fbe69839b1b7e15"
-  integrity sha512-l0RFuB8RLfCS0Pt2Id39/oCPykE01pyxgAFypWTlaGRgvLkZrtczZ8atEHpTeEIW+zYWXTBuA9cCSeEOScxReQ==
-  dependencies:
-    date-time "^2.1.0"
-    esutils "^2.0.2"
-    fast-diff "^1.1.2"
-    js-string-escape "^1.0.1"
-    lodash.clonedeep "^4.5.0"
-    lodash.flattendeep "^4.4.0"
-    lodash.islength "^4.0.1"
-    lodash.merge "^4.6.1"
-    md5-hex "^2.0.0"
-    semver "^5.5.1"
-    well-known-symbols "^2.0.0"
-
-configstore@^4.0.0:
-  version "4.0.0"
-  resolved "https://registry.yarnpkg.com/configstore/-/configstore-4.0.0.tgz#5933311e95d3687efb592c528b922d9262d227e7"
-  integrity sha512-CmquAXFBocrzaSM8mtGPMM/HiWmyIpr4CcJl/rgY2uCObZ/S7cKU0silxslqJejl+t/T9HS8E0PUNQD81JGUEQ==
-  dependencies:
-    dot-prop "^4.1.0"
-    graceful-fs "^4.1.2"
-    make-dir "^1.0.0"
-    unique-string "^1.0.0"
-    write-file-atomic "^2.0.0"
-    xdg-basedir "^3.0.0"
-
-convert-source-map@^1.1.0, convert-source-map@^1.6.0:
-  version "1.6.0"
-  resolved "https://registry.yarnpkg.com/convert-source-map/-/convert-source-map-1.6.0.tgz#51b537a8c43e0f04dec1993bffcdd504e758ac20"
-  integrity sha512-eFu7XigvxdZ1ETfbgPBohgyQ/Z++C0eEhTor0qRwBw9unw+L0/6V8wkSuGgzdThkiS5lSpdptOQPD8Ak40a+7A==
-  dependencies:
-    safe-buffer "~5.1.1"
-
-convert-to-spaces@^1.0.1:
-  version "1.0.2"
-  resolved "https://registry.yarnpkg.com/convert-to-spaces/-/convert-to-spaces-1.0.2.tgz#7e3e48bbe6d997b1417ddca2868204b4d3d85715"
-  integrity sha1-fj5Iu+bZl7FBfdyihoIEtNPYVxU=
-
-core-js@^2.0.0:
-  version "2.6.9"
-  resolved "https://registry.yarnpkg.com/core-js/-/core-js-2.6.9.tgz#6b4b214620c834152e179323727fc19741b084f2"
-  integrity sha512-HOpZf6eXmnl7la+cUdMnLvUxKNqLUzJvgIziQ0DiF3JwSImNphIqdGqzj6hIKyX04MmV0poclQ7+wjWvxQyR2A==
-
-cross-spawn@^5.0.1:
-  version "5.1.0"
-  resolved "https://registry.yarnpkg.com/cross-spawn/-/cross-spawn-5.1.0.tgz#e8bd0efee58fcff6f8f94510a0a554bbfa235449"
-  integrity sha1-6L0O/uWPz/b4+UUQoKVUu/ojVEk=
-  dependencies:
-    lru-cache "^4.0.1"
-    shebang-command "^1.2.0"
-    which "^1.2.9"
-
-crypto-random-string@^1.0.0:
-  version "1.0.0"
-  resolved "https://registry.yarnpkg.com/crypto-random-string/-/crypto-random-string-1.0.0.tgz#a230f64f568310e1498009940790ec99545bca7e"
-  integrity sha1-ojD2T1aDEOFJgAmUB5DsmVRbyn4=
-
-currently-unhandled@^0.4.1:
-  version "0.4.1"
-  resolved "https://registry.yarnpkg.com/currently-unhandled/-/currently-unhandled-0.4.1.tgz#988df33feab191ef799a61369dd76c17adf957ea"
-  integrity sha1-mI3zP+qxke95mmE2nddsF635V+o=
-  dependencies:
-    array-find-index "^1.0.1"
-
-date-time@^2.1.0:
-  version "2.1.0"
-  resolved "https://registry.yarnpkg.com/date-time/-/date-time-2.1.0.tgz#0286d1b4c769633b3ca13e1e62558d2dbdc2eba2"
-  integrity sha512-/9+C44X7lot0IeiyfgJmETtRMhBidBYM2QFFIkGa0U1k+hSyY87Nw7PY3eDqpvCBm7I3WCSfPeZskW/YYq6m4g==
-  dependencies:
-    time-zone "^1.0.0"
-
-debug@^4.1.0, debug@^4.1.1:
-  version "4.1.1"
-  resolved "https://registry.yarnpkg.com/debug/-/debug-4.1.1.tgz#3b72260255109c6b589cee050f1d516139664791"
-  integrity sha512-pYAIzeRo8J6KPEaJ0VWOh5Pzkbw/RetuzehGM7QRRX5he4fPHx2rdKMB256ehJCkX+XRQm16eZLqLNS8RSZXZw==
-  dependencies:
-    ms "^2.1.1"
-
-decamelize-keys@^1.0.0:
-  version "1.1.0"
-  resolved "https://registry.yarnpkg.com/decamelize-keys/-/decamelize-keys-1.1.0.tgz#d171a87933252807eb3cb61dc1c1445d078df2d9"
-  integrity sha1-0XGoeTMlKAfrPLYdwcFEXQeN8tk=
-  dependencies:
-    decamelize "^1.1.0"
-    map-obj "^1.0.0"
-
-decamelize@^1.1.0:
-  version "1.2.0"
-  resolved "https://registry.yarnpkg.com/decamelize/-/decamelize-1.2.0.tgz#f6534d15148269b20352e7bee26f501f9a191290"
-  integrity sha1-9lNNFRSCabIDUue+4m9QH5oZEpA=
-
-decompress-response@^3.3.0:
-  version "3.3.0"
-  resolved "https://registry.yarnpkg.com/decompress-response/-/decompress-response-3.3.0.tgz#80a4dd323748384bfa248083622aedec982adff3"
-  integrity sha1-gKTdMjdIOEv6JICDYirt7Jgq3/M=
-  dependencies:
-    mimic-response "^1.0.0"
-
-deep-equal@^1.0.0:
-  version "1.0.1"
-  resolved "https://registry.yarnpkg.com/deep-equal/-/deep-equal-1.0.1.tgz#f5d260292b660e084eff4cdbc9f08ad3247448b5"
-  integrity sha1-9dJgKStmDghO/0zbyfCK0yR0SLU=
-
-deep-extend@^0.6.0:
-  version "0.6.0"
-  resolved "https://registry.yarnpkg.com/deep-extend/-/deep-extend-0.6.0.tgz#c4fa7c95404a17a9c3e8ca7e1537312b736330ac"
-  integrity sha512-LOHxIOaPYdHlJRtCQfDIVZtfw/ufM8+rVj649RIHzcm/vGwQRXFt6OPqIFWsm2XEMrNIEtWR64sY1LEKD2vAOA==
-
-defaults@^1.0.3:
-  version "1.0.3"
-  resolved "https://registry.yarnpkg.com/defaults/-/defaults-1.0.3.tgz#c656051e9817d9ff08ed881477f3fe4019f3ef7d"
-  integrity sha1-xlYFHpgX2f8I7YgUd/P+QBnz730=
-  dependencies:
-    clone "^1.0.2"
-
-defer-to-connect@^1.0.1:
-  version "1.0.2"
-  resolved "https://registry.yarnpkg.com/defer-to-connect/-/defer-to-connect-1.0.2.tgz#4bae758a314b034ae33902b5aac25a8dd6a8633e"
-  integrity sha512-k09hcQcTDY+cwgiwa6PYKLm3jlagNzQ+RSvhjzESOGOx+MNOuXkxTfEvPrO1IOQ81tArCFYQgi631clB70RpQw==
-
-define-properties@^1.1.2:
-  version "1.1.3"
-  resolved "https://registry.yarnpkg.com/define-properties/-/define-properties-1.1.3.tgz#cf88da6cbee26fe6db7094f61d870cbd84cee9f1"
-  integrity sha512-3MqfYKj2lLzdMSf8ZIZE/V+Zuy+BgD6f164e8K2w7dgnpKArBDerGYpM46IYYcjnkdPNMjPk9A6VFB8+3SKlXQ==
-  dependencies:
-    object-keys "^1.0.12"
-
-del@^4.1.1:
-  version "4.1.1"
-  resolved "https://registry.yarnpkg.com/del/-/del-4.1.1.tgz#9e8f117222ea44a31ff3a156c049b99052a9f0b4"
-  integrity sha512-QwGuEUouP2kVwQenAsOof5Fv8K9t3D8Ca8NxcXKrIpEHjTXK5J2nXLdP+ALI1cgv8wj7KuwBhTwBkOZSJKM5XQ==
-  dependencies:
-    "@types/glob" "^7.1.1"
-    globby "^6.1.0"
-    is-path-cwd "^2.0.0"
-    is-path-in-cwd "^2.0.0"
-    p-map "^2.0.0"
-    pify "^4.0.1"
-    rimraf "^2.6.3"
-
-dir-glob@^3.0.1:
-  version "3.0.1"
-  resolved "https://registry.yarnpkg.com/dir-glob/-/dir-glob-3.0.1.tgz#56dbf73d992a4a93ba1584f4534063fd2e41717f"
-  integrity sha512-WkrWp9GR4KXfKGYzOLmTuGVi1UWFfws377n9cc55/tb6DuqyF6pcQ5AbiHEshaDpY9v6oaSr2XCDidGmMwdzIA==
-  dependencies:
-    path-type "^4.0.0"
-
-dot-prop@^4.1.0:
-  version "4.2.0"
-  resolved "https://registry.yarnpkg.com/dot-prop/-/dot-prop-4.2.0.tgz#1f19e0c2e1aa0e32797c49799f2837ac6af69c57"
-  integrity sha512-tUMXrxlExSW6U2EXiiKGSBVdYgtV8qlHL+C10TsW4PURY/ic+eaysnSkwB4kA/mBlCyy/IKDJ+Lc3wbWeaXtuQ==
-  dependencies:
-    is-obj "^1.0.0"
-
-dot-prop@^5.1.0:
-  version "5.1.0"
-  resolved "https://registry.yarnpkg.com/dot-prop/-/dot-prop-5.1.0.tgz#bdd8c986a77b83e3fca524e53786df916cabbd8a"
-  integrity sha512-n1oC6NBF+KM9oVXtjmen4Yo7HyAVWV2UUl50dCYJdw2924K6dX9bf9TTTWaKtYlRn0FEtxG27KS80ayVLixxJA==
-  dependencies:
-    is-obj "^2.0.0"
-
-duplexer3@^0.1.4:
-  version "0.1.4"
-  resolved "https://registry.yarnpkg.com/duplexer3/-/duplexer3-0.1.4.tgz#ee01dd1cac0ed3cbc7fdbea37dc0a8f1ce002ce2"
-  integrity sha1-7gHdHKwO08vH/b6jfcCo8c4ALOI=
-
-emittery@^0.4.1:
-  version "0.4.1"
-  resolved "https://registry.yarnpkg.com/emittery/-/emittery-0.4.1.tgz#abe9d3297389ba424ac87e53d1c701962ce7433d"
-  integrity sha512-r4eRSeStEGf6M5SKdrQhhLK5bOwOBxQhIE3YSTnZE3GpKiLfnnhE+tPtrJE79+eDJgm39BM6LSoI8SCx4HbwlQ==
-
-emoji-regex@^7.0.1:
-  version "7.0.3"
-  resolved "https://registry.yarnpkg.com/emoji-regex/-/emoji-regex-7.0.3.tgz#933a04052860c85e83c122479c4748a8e4c72156"
-  integrity sha512-CwBLREIQ7LvYFB0WyRvwhq5N5qPhc6PMjD6bYggFlI5YyDgl+0vxq5VHbMOFqLg7hfWzmu8T5Z1QofhmTIhItA==
-
-emoji-regex@^8.0.0:
-  version "8.0.0"
-  resolved "https://registry.yarnpkg.com/emoji-regex/-/emoji-regex-8.0.0.tgz#e818fd69ce5ccfcb404594f842963bf53164cc37"
-  integrity sha512-MSjYzcWNOA0ewAHpz0MxpYFvwg6yjy1NG3xteoqz644VCo/RPgnr1/GGt+ic3iJTzQ8Eu3TdM14SawnVUmGE6A==
-
-empower-core@^1.2.0:
-  version "1.2.0"
-  resolved "https://registry.yarnpkg.com/empower-core/-/empower-core-1.2.0.tgz#ce3fb2484d5187fa29c23fba8344b0b2fdf5601c"
-  integrity sha512-g6+K6Geyc1o6FdXs9HwrXleCFan7d66G5xSCfSF7x1mJDCes6t0om9lFQG3zOrzh3Bkb/45N0cZ5Gqsf7YrzGQ==
-  dependencies:
-    call-signature "0.0.2"
-    core-js "^2.0.0"
-
-end-of-stream@^1.1.0:
-  version "1.4.1"
-  resolved "https://registry.yarnpkg.com/end-of-stream/-/end-of-stream-1.4.1.tgz#ed29634d19baba463b6ce6b80a37213eab71ec43"
-  integrity sha512-1MkrZNvWTKCaigbn+W15elq2BB/L22nqrSY5DKlo3X6+vclJm8Bb5djXJBmEX6fS3+zCh/F4VBK5Z2KxJt4s2Q==
-  dependencies:
-    once "^1.4.0"
-
-equal-length@^1.0.0:
-  version "1.0.1"
-  resolved "https://registry.yarnpkg.com/equal-length/-/equal-length-1.0.1.tgz#21ca112d48ab24b4e1e7ffc0e5339d31fdfc274c"
-  integrity sha1-IcoRLUirJLTh5//A5TOdMf38J0w=
-
-error-ex@^1.3.1:
-  version "1.3.2"
-  resolved "https://registry.yarnpkg.com/error-ex/-/error-ex-1.3.2.tgz#b4ac40648107fdcdcfae242f428bea8a14d4f1bf"
-  integrity sha512-7dFHNmqeFSEt2ZBsCriorKnn3Z2pj+fd9kmI6QoWw4//DL+icEBfc0U7qJCisqrTsKTjw4fNFy2pW9OqStD84g==
-  dependencies:
-    is-arrayish "^0.2.1"
-
-es6-error@^4.0.1:
-  version "4.1.1"
-  resolved "https://registry.yarnpkg.com/es6-error/-/es6-error-4.1.1.tgz#9e3af407459deed47e9a91f9b885a84eb05c561d"
-  integrity sha512-Um/+FxMr9CISWh0bi5Zv0iOD+4cFh5qLeks1qhAopKVAJw3drgKbKySikp7wGhDL0HPeaja0P5ULZrxLkniUVg==
-
-escape-string-regexp@^1.0.5:
-  version "1.0.5"
-  resolved "https://registry.yarnpkg.com/escape-string-regexp/-/escape-string-regexp-1.0.5.tgz#1b61c0562190a8dff6ae3bb2cf0200ca130b86d4"
-  integrity sha1-G2HAViGQqN/2rjuyzwIAyhMLhtQ=
-
-escape-string-regexp@^2.0.0:
-  version "2.0.0"
-  resolved "https://registry.yarnpkg.com/escape-string-regexp/-/escape-string-regexp-2.0.0.tgz#a30304e99daa32e23b2fd20f51babd07cffca344"
-  integrity sha512-UpzcLCXolUWcNu5HtVMHYdXJjArjsF9C0aNnquZYY4uW/Vu0miy5YoWvbV345HauVvcAUnpRuhMMcqTcGOY2+w==
-
-esm@^3.2.25:
-  version "3.2.25"
-  resolved "https://registry.yarnpkg.com/esm/-/esm-3.2.25.tgz#342c18c29d56157688ba5ce31f8431fbb795cc10"
-  integrity sha512-U1suiZ2oDVWv4zPO56S0NcR5QriEahGtdN2OR6FiOG4WJvcjBVFB0qI4+eKoWFH483PKGuLuu6V8Z4T5g63UVA==
-
-espower-location-detector@^1.0.0:
-  version "1.0.0"
-  resolved "https://registry.yarnpkg.com/espower-location-detector/-/espower-location-detector-1.0.0.tgz#a17b7ecc59d30e179e2bef73fb4137704cb331b5"
-  integrity sha1-oXt+zFnTDheeK+9z+0E3cEyzMbU=
-  dependencies:
-    is-url "^1.2.1"
-    path-is-absolute "^1.0.0"
-    source-map "^0.5.0"
-    xtend "^4.0.0"
-
-esprima@^4.0.0:
-  version "4.0.1"
-  resolved "https://registry.yarnpkg.com/esprima/-/esprima-4.0.1.tgz#13b04cdb3e6c5d19df91ab6987a8695619b0aa71"
-  integrity sha512-eGuFFw7Upda+g4p+QHvnW0RyTX/SVeJBDM/gCtMARO0cLuT2HcEKnTPvhjV6aGeqrCB/sbNop0Kszm0jsaWU4A==
-
-espurify@^1.6.0:
-  version "1.8.1"
-  resolved "https://registry.yarnpkg.com/espurify/-/espurify-1.8.1.tgz#5746c6c1ab42d302de10bd1d5bf7f0e8c0515056"
-  integrity sha512-ZDko6eY/o+D/gHCWyHTU85mKDgYcS4FJj7S+YD6WIInm7GQ6AnOjmcL4+buFV/JOztVLELi/7MmuGU5NHta0Mg==
-  dependencies:
-    core-js "^2.0.0"
-
-estraverse@^4.0.0, estraverse@^4.1.1:
-  version "4.3.0"
-  resolved "https://registry.yarnpkg.com/estraverse/-/estraverse-4.3.0.tgz#398ad3f3c5a24948be7725e83d11a7de28cdbd1d"
-  integrity sha512-39nnKffWz8xN1BU/2c79n9nB9HDzo0niYUqx6xyqUnyoAnQyyWpOTdZEeiCch8BBu515t4wp9ZmgVfVhn9EBpw==
-
-esutils@^2.0.2:
-  version "2.0.3"
-  resolved "https://registry.yarnpkg.com/esutils/-/esutils-2.0.3.tgz#74d2eb4de0b8da1293711910d50775b9b710ef64"
-  integrity sha512-kVscqXk4OCp68SZ0dkgEKVi6/8ij300KBWTJq32P/dYeWTSwK41WyTxalN1eRmA5Z9UU/LX9D7FWSmV9SAYx6g==
-
-execa@^0.7.0:
-  version "0.7.0"
-  resolved "https://registry.yarnpkg.com/execa/-/execa-0.7.0.tgz#944becd34cc41ee32a63a9faf27ad5a65fc59777"
-  integrity sha1-lEvs00zEHuMqY6n68nrVpl/Fl3c=
-  dependencies:
-    cross-spawn "^5.0.1"
-    get-stream "^3.0.0"
-    is-stream "^1.1.0"
-    npm-run-path "^2.0.0"
-    p-finally "^1.0.0"
-    signal-exit "^3.0.0"
-    strip-eof "^1.0.0"
-
-fast-diff@^1.1.2:
-  version "1.2.0"
-  resolved "https://registry.yarnpkg.com/fast-diff/-/fast-diff-1.2.0.tgz#73ee11982d86caaf7959828d519cfe927fac5f03"
-  integrity sha512-xJuoT5+L99XlZ8twedaRf6Ax2TgQVxvgZOYoPKqZufmJib0tL2tegPBOZb1pVNgIhlqDlA0eO0c3wBvQcmzx4w==
-
-fast-glob@^3.0.3:
-  version "3.0.4"
-  resolved "https://registry.yarnpkg.com/fast-glob/-/fast-glob-3.0.4.tgz#d484a41005cb6faeb399b951fd1bd70ddaebb602"
-  integrity sha512-wkIbV6qg37xTJwqSsdnIphL1e+LaGz4AIQqr00mIubMaEhv1/HEmJ0uuCGZRNRUkZZmOB5mJKO0ZUTVq+SxMQg==
-  dependencies:
-    "@nodelib/fs.stat" "^2.0.1"
-    "@nodelib/fs.walk" "^1.2.1"
-    glob-parent "^5.0.0"
-    is-glob "^4.0.1"
-    merge2 "^1.2.3"
-    micromatch "^4.0.2"
-
-fastq@^1.6.0:
-  version "1.6.0"
-  resolved "https://registry.yarnpkg.com/fastq/-/fastq-1.6.0.tgz#4ec8a38f4ac25f21492673adb7eae9cfef47d1c2"
-  integrity sha512-jmxqQ3Z/nXoeyDmWAzF9kH1aGZSis6e/SbfPmJpUnyZ0ogr6iscHQaml4wsEepEWSdtmpy+eVXmCRIMpxaXqOA==
-  dependencies:
-    reusify "^1.0.0"
-
-figures@^3.0.0:
-  version "3.0.0"
-  resolved "https://registry.yarnpkg.com/figures/-/figures-3.0.0.tgz#756275c964646163cc6f9197c7a0295dbfd04de9"
-  integrity sha512-HKri+WoWoUgr83pehn/SIgLOMZ9nAWC6dcGj26RY2R4F50u4+RTUz0RCrUlOV3nKRAICW1UGzyb+kcX2qK1S/g==
-  dependencies:
-    escape-string-regexp "^1.0.5"
-
-fill-range@^7.0.1:
-  version "7.0.1"
-  resolved "https://registry.yarnpkg.com/fill-range/-/fill-range-7.0.1.tgz#1919a6a7c75fe38b2c7c77e5198535da9acdda40"
-  integrity sha512-qOo9F+dMUmC2Lcb4BbVvnKJxTPjCm+RRpe4gDuGrzkL7mEVl/djYSu2OdQ2Pa302N4oqkSg9ir6jaLWJ2USVpQ==
-  dependencies:
-    to-regex-range "^5.0.1"
-
-find-up@^2.0.0:
-  version "2.1.0"
-  resolved "https://registry.yarnpkg.com/find-up/-/find-up-2.1.0.tgz#45d1b7e506c717ddd482775a2b77920a3c0c57a7"
-  integrity sha1-RdG35QbHF93UgndaK3eSCjwMV6c=
-  dependencies:
-    locate-path "^2.0.0"
-
-find-up@^3.0.0:
-  version "3.0.0"
-  resolved "https://registry.yarnpkg.com/find-up/-/find-up-3.0.0.tgz#49169f1d7993430646da61ecc5ae355c21c97b73"
-  integrity sha512-1yD6RmLI1XBfxugvORwlck6f75tYL+iR0jqwsOrOxMZyGYqUuDhJ0l4AXdO1iX/FTs9cBAMEk1gWSEx1kSbylg==
-  dependencies:
-    locate-path "^3.0.0"
-
-find-up@^4.0.0, find-up@^4.1.0:
-  version "4.1.0"
-  resolved "https://registry.yarnpkg.com/find-up/-/find-up-4.1.0.tgz#97afe7d6cdc0bc5928584b7c8d7b16e8a9aa5d19"
-  integrity sha512-PpOwAdQ/YlXQ2vj8a3h8IipDuYRi3wceVQQGYWxNINccq40Anw7BlsEXCMbt1Zt+OLA6Fq9suIpIWD0OsnISlw==
-  dependencies:
-    locate-path "^5.0.0"
-    path-exists "^4.0.0"
-
-fs.realpath@^1.0.0:
-  version "1.0.0"
-  resolved "https://registry.yarnpkg.com/fs.realpath/-/fs.realpath-1.0.0.tgz#1504ad2523158caa40db4a2787cb01411994ea4f"
-  integrity sha1-FQStJSMVjKpA20onh8sBQRmU6k8=
-
-fsevents@^2.0.6:
-  version "2.0.7"
-  resolved "https://registry.yarnpkg.com/fsevents/-/fsevents-2.0.7.tgz#382c9b443c6cbac4c57187cdda23aa3bf1ccfc2a"
-  integrity sha512-a7YT0SV3RB+DjYcppwVDLtn13UQnmg0SWZS7ezZD0UjnLwXmy8Zm21GMVGLaFGimIqcvyMQaOJBrop8MyOp1kQ==
-
-function-bind@^1.1.1:
-  version "1.1.1"
-  resolved "https://registry.yarnpkg.com/function-bind/-/function-bind-1.1.1.tgz#a56899d3ea3c9bab874bb9773b7c5ede92f4895d"
-  integrity sha512-yIovAzMX49sF8Yl58fSCWJ5svSLuaibPxXQJFLmBObTuCr0Mf1KiPopGM9NiFjiYBCbfaa2Fh6breQ6ANVTI0A==
-
-get-port@^5.0.0:
-  version "5.0.0"
-  resolved "https://registry.yarnpkg.com/get-port/-/get-port-5.0.0.tgz#aa22b6b86fd926dd7884de3e23332c9f70c031a6"
-  integrity sha512-imzMU0FjsZqNa6BqOjbbW6w5BivHIuQKopjpPqcnx0AVHJQKCxK1O+Ab3OrVXhrekqfVMjwA9ZYu062R+KcIsQ==
-  dependencies:
-    type-fest "^0.3.0"
-
-get-stream@^3.0.0:
-  version "3.0.0"
-  resolved "https://registry.yarnpkg.com/get-stream/-/get-stream-3.0.0.tgz#8e943d1358dc37555054ecbe2edb05aa174ede14"
-  integrity sha1-jpQ9E1jcN1VQVOy+LtsFqhdO3hQ=
-
-get-stream@^4.1.0:
-  version "4.1.0"
-  resolved "https://registry.yarnpkg.com/get-stream/-/get-stream-4.1.0.tgz#c1b255575f3dc21d59bfc79cd3d2b46b1c3a54b5"
-  integrity sha512-GMat4EJ5161kIy2HevLlr4luNjBgvmj413KaQA7jt4V8B4RDsfpHk7WQ9GVqfYyyx8OS/L66Kox+rJRNklLK7w==
-  dependencies:
-    pump "^3.0.0"
-
-get-stream@^5.1.0:
-  version "5.1.0"
-  resolved "https://registry.yarnpkg.com/get-stream/-/get-stream-5.1.0.tgz#01203cdc92597f9b909067c3e656cc1f4d3c4dc9"
-  integrity sha512-EXr1FOzrzTfGeL0gQdeFEvOMm2mzMOglyiOXSTpPC+iAjAKftbr3jpCMWynogwYnM+eSj9sHGc6wjIcDvYiygw==
-  dependencies:
-    pump "^3.0.0"
-
-glob-parent@^5.0.0:
-  version "5.0.0"
-  resolved "https://registry.yarnpkg.com/glob-parent/-/glob-parent-5.0.0.tgz#1dc99f0f39b006d3e92c2c284068382f0c20e954"
-  integrity sha512-Z2RwiujPRGluePM6j699ktJYxmPpJKCfpGA13jz2hmFZC7gKetzrWvg5KN3+OsIFmydGyZ1AVwERCq1w/ZZwRg==
-  dependencies:
-    is-glob "^4.0.1"
-
-glob@^7.0.3, glob@^7.1.3:
-  version "7.1.4"
-  resolved "https://registry.yarnpkg.com/glob/-/glob-7.1.4.tgz#aa608a2f6c577ad357e1ae5a5c26d9a8d1969255"
-  integrity sha512-hkLPepehmnKk41pUGm3sYxoFs/umurYfYJCerbXEyFIWcAzvpipAgVkBqqT9RBKMGjnq6kMuyYwha6csxbiM1A==
-  dependencies:
-    fs.realpath "^1.0.0"
-    inflight "^1.0.4"
-    inherits "2"
-    minimatch "^3.0.4"
-    once "^1.3.0"
-    path-is-absolute "^1.0.0"
-
-global-dirs@^0.1.0:
-  version "0.1.1"
-  resolved "https://registry.yarnpkg.com/global-dirs/-/global-dirs-0.1.1.tgz#b319c0dd4607f353f3be9cca4c72fc148c49f445"
-  integrity sha1-sxnA3UYH81PzvpzKTHL8FIxJ9EU=
-  dependencies:
-    ini "^1.3.4"
-
-globals@^11.1.0:
-  version "11.12.0"
-  resolved "https://registry.yarnpkg.com/globals/-/globals-11.12.0.tgz#ab8795338868a0babd8525758018c2a7eb95c42e"
-  integrity sha512-WOBp/EEGUiIsJSp7wcv/y6MO+lV9UoncWqxuFfm8eBwzWNgyfBd6Gz+IeKQ9jCmyhoH99g15M3T+QaVHFjizVA==
-
-globby@^10.0.1:
-  version "10.0.1"
-  resolved "https://registry.yarnpkg.com/globby/-/globby-10.0.1.tgz#4782c34cb75dd683351335c5829cc3420e606b22"
-  integrity sha512-sSs4inE1FB2YQiymcmTv6NWENryABjUNPeWhOvmn4SjtKybglsyPZxFB3U1/+L1bYi0rNZDqCLlHyLYDl1Pq5A==
-  dependencies:
-    "@types/glob" "^7.1.1"
-    array-union "^2.1.0"
-    dir-glob "^3.0.1"
-    fast-glob "^3.0.3"
-    glob "^7.1.3"
-    ignore "^5.1.1"
-    merge2 "^1.2.3"
-    slash "^3.0.0"
-
-globby@^6.1.0:
-  version "6.1.0"
-  resolved "https://registry.yarnpkg.com/globby/-/globby-6.1.0.tgz#f5a6d70e8395e21c858fb0489d64df02424d506c"
-  integrity sha1-9abXDoOV4hyFj7BInWTfAkJNUGw=
-  dependencies:
-    array-union "^1.0.1"
-    glob "^7.0.3"
-    object-assign "^4.0.1"
-    pify "^2.0.0"
-    pinkie-promise "^2.0.0"
-
-got@^9.6.0:
-  version "9.6.0"
-  resolved "https://registry.yarnpkg.com/got/-/got-9.6.0.tgz#edf45e7d67f99545705de1f7bbeeeb121765ed85"
-  integrity sha512-R7eWptXuGYxwijs0eV+v3o6+XH1IqVK8dJOEecQfTmkncw9AV4dcw/Dhxi8MdlqPthxxpZyizMzyg8RTmEsG+Q==
-  dependencies:
-    "@sindresorhus/is" "^0.14.0"
-    "@szmarczak/http-timer" "^1.1.2"
-    cacheable-request "^6.0.0"
-    decompress-response "^3.3.0"
-    duplexer3 "^0.1.4"
-    get-stream "^4.1.0"
-    lowercase-keys "^1.0.1"
-    mimic-response "^1.0.1"
-    p-cancelable "^1.0.0"
-    to-readable-stream "^1.0.0"
-    url-parse-lax "^3.0.0"
-
-graceful-fs@^4.1.11, graceful-fs@^4.1.15, graceful-fs@^4.1.2:
-  version "4.2.2"
-  resolved "https://registry.yarnpkg.com/graceful-fs/-/graceful-fs-4.2.2.tgz#6f0952605d0140c1cfdb138ed005775b92d67b02"
-  integrity sha512-IItsdsea19BoLC7ELy13q1iJFNmd7ofZH5+X/pJr90/nRoPEX0DJo1dHDbgtYWOhJhcCgMDTOw84RZ72q6lB+Q==
-
-has-flag@^3.0.0:
-  version "3.0.0"
-  resolved "https://registry.yarnpkg.com/has-flag/-/has-flag-3.0.0.tgz#b5d454dc2199ae225699f3467e5a07f3b955bafd"
-  integrity sha1-tdRU3CGZriJWmfNGfloH87lVuv0=
-
-has-flag@^4.0.0:
-  version "4.0.0"
-  resolved "https://registry.yarnpkg.com/has-flag/-/has-flag-4.0.0.tgz#944771fd9c81c81265c4d6941860da06bb59479b"
-  integrity sha512-EykJT/Q1KjTWctppgIAgfSO0tKVuZUjhgMr17kqTumMl6Afv3EISleU7qZUzoXDFTAHTDC4NOoG/ZxU3EvlMPQ==
-
-has-symbols@^1.0.0:
-  version "1.0.0"
-  resolved "https://registry.yarnpkg.com/has-symbols/-/has-symbols-1.0.0.tgz#ba1a8f1af2a0fc39650f5c850367704122063b44"
-  integrity sha1-uhqPGvKg/DllD1yFA2dwQSIGO0Q=
-
-has-yarn@^2.1.0:
-  version "2.1.0"
-  resolved "https://registry.yarnpkg.com/has-yarn/-/has-yarn-2.1.0.tgz#137e11354a7b5bf11aa5cb649cf0c6f3ff2b2e77"
-  integrity sha512-UqBRqi4ju7T+TqGNdqAO0PaSVGsDGJUBQvk9eUWNGRY1CFGDzYhLWoM7JQEemnlvVcv/YEmc2wNW8BC24EnUsw==
-
-hasha@^5.0.0:
-  version "5.0.0"
-  resolved "https://registry.yarnpkg.com/hasha/-/hasha-5.0.0.tgz#fdc3785caea03df29535fc8adb512c3d3a709004"
-  integrity sha512-PqWdhnQhq6tqD32hZv+l1e5mJHNSudjnaAzgAHfkGiU0ABN6lmbZF8abJIulQHbZ7oiHhP8yL6O910ICMc+5pw==
-  dependencies:
-    is-stream "^1.1.0"
-    type-fest "^0.3.0"
-
-hosted-git-info@^2.1.4:
-  version "2.8.4"
-  resolved "https://registry.yarnpkg.com/hosted-git-info/-/hosted-git-info-2.8.4.tgz#44119abaf4bc64692a16ace34700fed9c03e2546"
-  integrity sha512-pzXIvANXEFrc5oFFXRMkbLPQ2rXRoDERwDLyrcUxGhaZhgP54BBSl9Oheh7Vv0T090cszWBxPjkQQ5Sq1PbBRQ==
-
-http-cache-semantics@^4.0.0:
-  version "4.0.3"
-  resolved "https://registry.yarnpkg.com/http-cache-semantics/-/http-cache-semantics-4.0.3.tgz#495704773277eeef6e43f9ab2c2c7d259dda25c5"
-  integrity sha512-TcIMG3qeVLgDr1TEd2XvHaTnMPwYQUQMIBLy+5pLSDKYFc7UIqj39w8EGzZkaxoLv/l2K8HaI0t5AVA+YYgUew==
-
-ignore-by-default@^1.0.0:
-  version "1.0.1"
-  resolved "https://registry.yarnpkg.com/ignore-by-default/-/ignore-by-default-1.0.1.tgz#48ca6d72f6c6a3af00a9ad4ae6876be3889e2b09"
-  integrity sha1-SMptcvbGo68Aqa1K5odr44ieKwk=
-
-ignore@^5.1.1:
-  version "5.1.4"
-  resolved "https://registry.yarnpkg.com/ignore/-/ignore-5.1.4.tgz#84b7b3dbe64552b6ef0eca99f6743dbec6d97adf"
-  integrity sha512-MzbUSahkTW1u7JpKKjY7LCARd1fU5W2rLdxlM4kdkayuCwZImjkpluF9CM1aLewYJguPDqewLam18Y6AU69A8A==
-
-import-lazy@^2.1.0:
-  version "2.1.0"
-  resolved "https://registry.yarnpkg.com/import-lazy/-/import-lazy-2.1.0.tgz#05698e3d45c88e8d7e9d92cb0584e77f096f3e43"
-  integrity sha1-BWmOPUXIjo1+nZLLBYTnfwlvPkM=
-
-import-local@^3.0.2:
-  version "3.0.2"
-  resolved "https://registry.yarnpkg.com/import-local/-/import-local-3.0.2.tgz#a8cfd0431d1de4a2199703d003e3e62364fa6db6"
-  integrity sha512-vjL3+w0oulAVZ0hBHnxa/Nm5TAurf9YLQJDhqRZyqb+VKGOB6LU8t9H1Nr5CIo16vh9XfJTOoHwU0B71S557gA==
-  dependencies:
-    pkg-dir "^4.2.0"
-    resolve-cwd "^3.0.0"
-
-imurmurhash@^0.1.4:
-  version "0.1.4"
-  resolved "https://registry.yarnpkg.com/imurmurhash/-/imurmurhash-0.1.4.tgz#9218b9b2b928a238b13dc4fb6b6d576f231453ea"
-  integrity sha1-khi5srkoojixPcT7a21XbyMUU+o=
-
-indent-string@^3.0.0, indent-string@^3.2.0:
-  version "3.2.0"
-  resolved "https://registry.yarnpkg.com/indent-string/-/indent-string-3.2.0.tgz#4a5fd6d27cc332f37e5419a504dbb837105c9289"
-  integrity sha1-Sl/W0nzDMvN+VBmlBNu4NxBckok=
-
-indent-string@^4.0.0:
-  version "4.0.0"
-  resolved "https://registry.yarnpkg.com/indent-string/-/indent-string-4.0.0.tgz#624f8f4497d619b2d9768531d58f4122854d7251"
-  integrity sha512-EdDDZu4A2OyIK7Lr/2zG+w5jmbuk1DVBnEwREQvBzspBJkCEbRa8GxU1lghYcaGJCnRWibjDXlq779X1/y5xwg==
-
-inflight@^1.0.4:
-  version "1.0.6"
-  resolved "https://registry.yarnpkg.com/inflight/-/inflight-1.0.6.tgz#49bd6331d7d02d0c09bc910a1075ba8165b56df9"
-  integrity sha1-Sb1jMdfQLQwJvJEKEHW6gWW1bfk=
-  dependencies:
-    once "^1.3.0"
-    wrappy "1"
-
-inherits@2:
-  version "2.0.4"
-  resolved "https://registry.yarnpkg.com/inherits/-/inherits-2.0.4.tgz#0fa2c64f932917c3433a0ded55363aae37416b7c"
-  integrity sha512-k/vGaX4/Yla3WzyMCvTQOXYeIHvqOKtnqBduzTHpzpQZzAskKMhZ2K+EnBiSM9zGSoIFeMpXKxa4dYeZIQqewQ==
-
-ini@^1.3.4, ini@~1.3.0:
-  version "1.3.5"
-  resolved "https://registry.yarnpkg.com/ini/-/ini-1.3.5.tgz#eee25f56db1c9ec6085e0c22778083f596abf927"
-  integrity sha512-RZY5huIKCMRWDUqZlEi72f/lmXKMvuszcMBduliQ3nnWbx9X/ZBQO7DijMEYS9EhHBb2qacRUMtC7svLwe0lcw==
-
-irregular-plurals@^2.0.0:
-  version "2.0.0"
-  resolved "https://registry.yarnpkg.com/irregular-plurals/-/irregular-plurals-2.0.0.tgz#39d40f05b00f656d0b7fa471230dd3b714af2872"
-  integrity sha512-Y75zBYLkh0lJ9qxeHlMjQ7bSbyiSqNW/UOPWDmzC7cXskL1hekSITh1Oc6JV0XCWWZ9DE8VYSB71xocLk3gmGw==
-
-is-arrayish@^0.2.1:
-  version "0.2.1"
-  resolved "https://registry.yarnpkg.com/is-arrayish/-/is-arrayish-0.2.1.tgz#77c99840527aa8ecb1a8ba697b80645a7a926a9d"
-  integrity sha1-d8mYQFJ6qOyxqLppe4BkWnqSap0=
-
-is-binary-path@^2.1.0:
-  version "2.1.0"
-  resolved "https://registry.yarnpkg.com/is-binary-path/-/is-binary-path-2.1.0.tgz#ea1f7f3b80f064236e83470f86c09c254fb45b09"
-  integrity sha512-ZMERYes6pDydyuGidse7OsHxtbI7WVeUEozgR/g7rd0xUimYNlvZRE/K2MgZTjWy725IfelLeVcEM97mmtRGXw==
-  dependencies:
-    binary-extensions "^2.0.0"
-
-is-ci@^2.0.0:
-  version "2.0.0"
-  resolved "https://registry.yarnpkg.com/is-ci/-/is-ci-2.0.0.tgz#6bc6334181810e04b5c22b3d589fdca55026404c"
-  integrity sha512-YfJT7rkpQB0updsdHLGWrvhBJfcfzNNawYDNIyQXJz0IViGf75O8EBPKSdvw2rF+LGCsX4FZ8tcr3b19LcZq4w==
-  dependencies:
-    ci-info "^2.0.0"
-
-is-error@^2.2.2:
-  version "2.2.2"
-  resolved "https://registry.yarnpkg.com/is-error/-/is-error-2.2.2.tgz#c10ade187b3c93510c5470a5567833ee25649843"
-  integrity sha512-IOQqts/aHWbiisY5DuPJQ0gcbvaLFCa7fBa9xoLfxBZvQ+ZI/Zh9xoI7Gk+G64N0FdK4AbibytHht2tWgpJWLg==
-
-is-extglob@^2.1.1:
-  version "2.1.1"
-  resolved "https://registry.yarnpkg.com/is-extglob/-/is-extglob-2.1.1.tgz#a88c02535791f02ed37c76a1b9ea9773c833f8c2"
-  integrity sha1-qIwCU1eR8C7TfHahueqXc8gz+MI=
-
-is-fullwidth-code-point@^2.0.0:
-  version "2.0.0"
-  resolved "https://registry.yarnpkg.com/is-fullwidth-code-point/-/is-fullwidth-code-point-2.0.0.tgz#a3b30a5c4f199183167aaab93beefae3ddfb654f"
-  integrity sha1-o7MKXE8ZkYMWeqq5O+764937ZU8=
-
-is-fullwidth-code-point@^3.0.0:
-  version "3.0.0"
-  resolved "https://registry.yarnpkg.com/is-fullwidth-code-point/-/is-fullwidth-code-point-3.0.0.tgz#f116f8064fe90b3f7844a38997c0b75051269f1d"
-  integrity sha512-zymm5+u+sCsSWyD9qNaejV3DFvhCKclKdizYaJUuHA83RLjb7nSuGnddCHGv0hk+KY7BMAlsWeK4Ueg6EV6XQg==
-
-is-glob@^4.0.1:
-  version "4.0.1"
-  resolved "https://registry.yarnpkg.com/is-glob/-/is-glob-4.0.1.tgz#7567dbe9f2f5e2467bc77ab83c4a29482407a5dc"
-  integrity sha512-5G0tKtBTFImOqDnLB2hG6Bp2qcKEFduo4tZu9MT/H6NQv/ghhy30o55ufafxJ/LdH79LLs2Kfrn85TLKyA7BUg==
-  dependencies:
-    is-extglob "^2.1.1"
-
-is-installed-globally@^0.1.0:
-  version "0.1.0"
-  resolved "https://registry.yarnpkg.com/is-installed-globally/-/is-installed-globally-0.1.0.tgz#0dfd98f5a9111716dd535dda6492f67bf3d25a80"
-  integrity sha1-Df2Y9akRFxbdU13aZJL2e/PSWoA=
-  dependencies:
-    global-dirs "^0.1.0"
-    is-path-inside "^1.0.0"
-
-is-npm@^3.0.0:
-  version "3.0.0"
-  resolved "https://registry.yarnpkg.com/is-npm/-/is-npm-3.0.0.tgz#ec9147bfb629c43f494cf67936a961edec7e8053"
-  integrity sha512-wsigDr1Kkschp2opC4G3yA6r9EgVA6NjRpWzIi9axXqeIaAATPRJc4uLujXe3Nd9uO8KoDyA4MD6aZSeXTADhA==
-
-is-number@^7.0.0:
-  version "7.0.0"
-  resolved "https://registry.yarnpkg.com/is-number/-/is-number-7.0.0.tgz#7535345b896734d5f80c4d06c50955527a14f12b"
-  integrity sha512-41Cifkg6e8TylSpdtTpeLVMqvSBEVzTttHvERD741+pnZ8ANv0004MRL43QKPDlK9cGvNp6NZWZUBlbGXYxxng==
-
-is-obj@^1.0.0:
-  version "1.0.1"
-  resolved "https://registry.yarnpkg.com/is-obj/-/is-obj-1.0.1.tgz#3e4729ac1f5fde025cd7d83a896dab9f4f67db0f"
-  integrity sha1-PkcprB9f3gJc19g6iW2rn09n2w8=
-
-is-obj@^2.0.0:
-  version "2.0.0"
-  resolved "https://registry.yarnpkg.com/is-obj/-/is-obj-2.0.0.tgz#473fb05d973705e3fd9620545018ca8e22ef4982"
-  integrity sha512-drqDG3cbczxxEJRoOXcOjtdp1J/lyp1mNn0xaznRs8+muBhgQcrnbspox5X5fOw0HnMnbfDzvnEMEtqDEJEo8w==
-
-is-observable@^2.0.0:
-  version "2.0.0"
-  resolved "https://registry.yarnpkg.com/is-observable/-/is-observable-2.0.0.tgz#327af1e8cdea9cd717f95911b87c5d34301721a6"
-  integrity sha512-fhBZv3eFKUbyHXZ1oHujdo2tZ+CNbdpdzzlENgCGZUC8keoGxUew2jYFLYcUB4qo7LDD03o4KK11m/QYD7kEjg==
-
-is-path-cwd@^2.0.0:
-  version "2.2.0"
-  resolved "https://registry.yarnpkg.com/is-path-cwd/-/is-path-cwd-2.2.0.tgz#67d43b82664a7b5191fd9119127eb300048a9fdb"
-  integrity sha512-w942bTcih8fdJPJmQHFzkS76NEP8Kzzvmw92cXsazb8intwLqPibPPdXf4ANdKV3rYMuuQYGIWtvz9JilB3NFQ==
-
-is-path-in-cwd@^2.0.0:
-  version "2.1.0"
-  resolved "https://registry.yarnpkg.com/is-path-in-cwd/-/is-path-in-cwd-2.1.0.tgz#bfe2dca26c69f397265a4009963602935a053acb"
-  integrity sha512-rNocXHgipO+rvnP6dk3zI20RpOtrAM/kzbB258Uw5BWr3TpXi861yzjo16Dn4hUox07iw5AyeMLHWsujkjzvRQ==
-  dependencies:
-    is-path-inside "^2.1.0"
-
-is-path-inside@^1.0.0:
-  version "1.0.1"
-  resolved "https://registry.yarnpkg.com/is-path-inside/-/is-path-inside-1.0.1.tgz#8ef5b7de50437a3fdca6b4e865ef7aa55cb48036"
-  integrity sha1-jvW33lBDej/cprToZe96pVy0gDY=
-  dependencies:
-    path-is-inside "^1.0.1"
-
-is-path-inside@^2.1.0:
-  version "2.1.0"
-  resolved "https://registry.yarnpkg.com/is-path-inside/-/is-path-inside-2.1.0.tgz#7c9810587d659a40d27bcdb4d5616eab059494b2"
-  integrity sha512-wiyhTzfDWsvwAW53OBWF5zuvaOGlZ6PwYxAbPVDhpm+gM09xKQGjBq/8uYN12aDvMxnAnq3dxTyoSoRNmg5YFg==
-  dependencies:
-    path-is-inside "^1.0.2"
-
-is-plain-obj@^1.1.0:
-  version "1.1.0"
-  resolved "https://registry.yarnpkg.com/is-plain-obj/-/is-plain-obj-1.1.0.tgz#71a50c8429dfca773c92a390a4a03b39fcd51d3e"
-  integrity sha1-caUMhCnfync8kqOQpKA7OfzVHT4=
-
-is-plain-object@^3.0.0:
-  version "3.0.0"
-  resolved "https://registry.yarnpkg.com/is-plain-object/-/is-plain-object-3.0.0.tgz#47bfc5da1b5d50d64110806c199359482e75a928"
-  integrity sha512-tZIpofR+P05k8Aocp7UI/2UTa9lTJSebCXpFFoR9aibpokDj/uXBsJ8luUu0tTVYKkMU6URDUuOfJZ7koewXvg==
-  dependencies:
-    isobject "^4.0.0"
-
-is-promise@^2.1.0:
-  version "2.1.0"
-  resolved "https://registry.yarnpkg.com/is-promise/-/is-promise-2.1.0.tgz#79a2a9ece7f096e80f36d2b2f3bc16c1ff4bf3fa"
-  integrity sha1-eaKp7OfwlugPNtKy87wWwf9L8/o=
-
-is-stream@^1.1.0:
-  version "1.1.0"
-  resolved "https://registry.yarnpkg.com/is-stream/-/is-stream-1.1.0.tgz#12d4a3dd4e68e0b79ceb8dbc84173ae80d91ca44"
-  integrity sha1-EtSj3U5o4Lec6428hBc66A2RykQ=
-
-is-typedarray@^1.0.0:
-  version "1.0.0"
-  resolved "https://registry.yarnpkg.com/is-typedarray/-/is-typedarray-1.0.0.tgz#e479c80858df0c1b11ddda6940f96011fcda4a9a"
-  integrity sha1-5HnICFjfDBsR3dppQPlgEfzaSpo=
-
-is-url@^1.2.1:
-  version "1.2.4"
-  resolved "https://registry.yarnpkg.com/is-url/-/is-url-1.2.4.tgz#04a4df46d28c4cff3d73d01ff06abeb318a1aa52"
-  integrity sha512-ITvGim8FhRiYe4IQ5uHSkj7pVaPDrCTkNd3yq3cV7iZAcJdHTUMPMEHcqSOy9xZ9qFenQCvi+2wjH9a1nXqHww==
-
-is-utf8@^0.2.1:
-  version "0.2.1"
-  resolved "https://registry.yarnpkg.com/is-utf8/-/is-utf8-0.2.1.tgz#4b0da1442104d1b336340e80797e865cf39f7d72"
-  integrity sha1-Sw2hRCEE0bM2NA6AeX6GXPOffXI=
-
-is-yarn-global@^0.3.0:
-  version "0.3.0"
-  resolved "https://registry.yarnpkg.com/is-yarn-global/-/is-yarn-global-0.3.0.tgz#d502d3382590ea3004893746754c89139973e232"
-  integrity sha512-VjSeb/lHmkoyd8ryPVIKvOCn4D1koMqY+vqyjjUfc3xyKtP4dYOxM44sZrnqQSzSds3xyOrUTLTC9LVCVgLngw==
-
-isexe@^2.0.0:
-  version "2.0.0"
-  resolved "https://registry.yarnpkg.com/isexe/-/isexe-2.0.0.tgz#e8fbf374dc556ff8947a10dcb0572d633f2cfa10"
-  integrity sha1-6PvzdNxVb/iUehDcsFctYz8s+hA=
-
-isobject@^4.0.0:
-  version "4.0.0"
-  resolved "https://registry.yarnpkg.com/isobject/-/isobject-4.0.0.tgz#3f1c9155e73b192022a80819bacd0343711697b0"
-  integrity sha512-S/2fF5wH8SJA/kmwr6HYhK/RI/OkhD84k8ntalo0iJjZikgq1XFvR5M8NPT1x5F7fBwCG3qHfnzeP/Vh/ZxCUA==
-
-js-string-escape@^1.0.1:
-  version "1.0.1"
-  resolved "https://registry.yarnpkg.com/js-string-escape/-/js-string-escape-1.0.1.tgz#e2625badbc0d67c7533e9edc1068c587ae4137ef"
-  integrity sha1-4mJbrbwNZ8dTPp7cEGjFh65BN+8=
-
-js-tokens@^4.0.0:
-  version "4.0.0"
-  resolved "https://registry.yarnpkg.com/js-tokens/-/js-tokens-4.0.0.tgz#19203fb59991df98e3a287050d4647cdeaf32499"
-  integrity sha512-RdJUflcE3cUzKiMqQgsCu06FPu9UdIJO0beYbPhHN4k6apgJtifcoCtT9bcxOpYBtpD2kCM6Sbzg4CausW/PKQ==
-
-js-yaml@^3.10.0:
-  version "3.13.1"
-  resolved "https://registry.yarnpkg.com/js-yaml/-/js-yaml-3.13.1.tgz#aff151b30bfdfa8e49e05da22e7415e9dfa37847"
-  integrity sha512-YfbcO7jXDdyj0DGxYVSlSeQNHbD7XPWvrVWeVUujrQEoZzWJIRrCPoyk6kL6IAjAG2IolMK4T0hNUe0HOUs5Jw==
-  dependencies:
-    argparse "^1.0.7"
-    esprima "^4.0.0"
-
-jsesc@^2.5.1:
-  version "2.5.2"
-  resolved "https://registry.yarnpkg.com/jsesc/-/jsesc-2.5.2.tgz#80564d2e483dacf6e8ef209650a67df3f0c283a4"
-  integrity sha512-OYu7XEzjkCQ3C5Ps3QIZsQfNpqoJyZZA99wd9aWd05NCtC5pWOkShK2mkL6HXQR6/Cy2lbNdPlZBpuQHXE63gA==
-
-jsesc@~0.5.0:
-  version "0.5.0"
-  resolved "https://registry.yarnpkg.com/jsesc/-/jsesc-0.5.0.tgz#e7dee66e35d6fc16f710fe91d5cf69f70f08911d"
-  integrity sha1-597mbjXW/Bb3EP6R1c9p9w8IkR0=
-
-json-buffer@3.0.0:
-  version "3.0.0"
-  resolved "https://registry.yarnpkg.com/json-buffer/-/json-buffer-3.0.0.tgz#5b1f397afc75d677bde8bcfc0e47e1f9a3d9a898"
-  integrity sha1-Wx85evx11ne96Lz8Dkfh+aPZqJg=
-
-json-parse-better-errors@^1.0.1:
-  version "1.0.2"
-  resolved "https://registry.yarnpkg.com/json-parse-better-errors/-/json-parse-better-errors-1.0.2.tgz#bb867cfb3450e69107c131d1c514bab3dc8bcaa9"
-  integrity sha512-mrqyZKfX5EhL7hvqcV6WG1yYjnjeuYDzDhhcAAUrq8Po85NBQBJP+ZDUT75qZQ98IkUoBqdkExkukOU7Ts2wrw==
-
-json5@^2.1.0:
-  version "2.1.0"
-  resolved "https://registry.yarnpkg.com/json5/-/json5-2.1.0.tgz#e7a0c62c48285c628d20a10b85c89bb807c32850"
-  integrity sha512-8Mh9h6xViijj36g7Dxi+Y4S6hNGV96vcJZr/SrlHh1LR/pEn/8j/+qIBbs44YKl69Lrfctp4QD+AdWLTMqEZAQ==
-  dependencies:
-    minimist "^1.2.0"
-
-keyv@^3.0.0:
-  version "3.1.0"
-  resolved "https://registry.yarnpkg.com/keyv/-/keyv-3.1.0.tgz#ecc228486f69991e49e9476485a5be1e8fc5c4d9"
-  integrity sha512-9ykJ/46SN/9KPM/sichzQ7OvXyGDYKGTaDlKMGCAlg2UK8KRy4jb0d8sFc+0Tt0YYnThq8X2RZgCg74RPxgcVA==
-  dependencies:
-    json-buffer "3.0.0"
-
-latest-version@^5.0.0:
-  version "5.1.0"
-  resolved "https://registry.yarnpkg.com/latest-version/-/latest-version-5.1.0.tgz#119dfe908fe38d15dfa43ecd13fa12ec8832face"
-  integrity sha512-weT+r0kTkRQdCdYCNtkMwWXQTMEswKrFBkm4ckQOMVhhqhIMI1UT2hMj+1iigIhgSZm5gTmrRXBNoGUgaTY1xA==
-  dependencies:
-    package-json "^6.3.0"
-
-load-json-file@^4.0.0:
-  version "4.0.0"
-  resolved "https://registry.yarnpkg.com/load-json-file/-/load-json-file-4.0.0.tgz#2f5f45ab91e33216234fd53adab668eb4ec0993b"
-  integrity sha1-L19Fq5HjMhYjT9U62rZo607AmTs=
-  dependencies:
-    graceful-fs "^4.1.2"
-    parse-json "^4.0.0"
-    pify "^3.0.0"
-    strip-bom "^3.0.0"
-
-load-json-file@^5.2.0:
-  version "5.3.0"
-  resolved "https://registry.yarnpkg.com/load-json-file/-/load-json-file-5.3.0.tgz#4d3c1e01fa1c03ea78a60ac7af932c9ce53403f3"
-  integrity sha512-cJGP40Jc/VXUsp8/OrnyKyTZ1y6v/dphm3bioS+RrKXjK2BB6wHUd6JptZEFDGgGahMT+InnZO5i1Ei9mpC8Bw==
-  dependencies:
-    graceful-fs "^4.1.15"
-    parse-json "^4.0.0"
-    pify "^4.0.1"
-    strip-bom "^3.0.0"
-    type-fest "^0.3.0"
-
-locate-path@^2.0.0:
-  version "2.0.0"
-  resolved "https://registry.yarnpkg.com/locate-path/-/locate-path-2.0.0.tgz#2b568b265eec944c6d9c0de9c3dbbbca0354cd8e"
-  integrity sha1-K1aLJl7slExtnA3pw9u7ygNUzY4=
-  dependencies:
-    p-locate "^2.0.0"
-    path-exists "^3.0.0"
-
-locate-path@^3.0.0:
-  version "3.0.0"
-  resolved "https://registry.yarnpkg.com/locate-path/-/locate-path-3.0.0.tgz#dbec3b3ab759758071b58fe59fc41871af21400e"
-  integrity sha512-7AO748wWnIhNqAuaty2ZWHkQHRSNfPVIsPIfwEOWO22AmaoVrWavlOcMR5nzTLNYvp36X220/maaRsrec1G65A==
-  dependencies:
-    p-locate "^3.0.0"
-    path-exists "^3.0.0"
-
-locate-path@^5.0.0:
-  version "5.0.0"
-  resolved "https://registry.yarnpkg.com/locate-path/-/locate-path-5.0.0.tgz#1afba396afd676a6d42504d0a67a3a7eb9f62aa0"
-  integrity sha512-t7hw9pI+WvuwNJXwk5zVHpyhIqzg2qTlklJOf0mVxGSbe3Fp2VieZcduNYjaLDoy6p9uGpQEGWG87WpMKlNq8g==
-  dependencies:
-    p-locate "^4.1.0"
-
-lodash.clonedeep@^4.5.0:
-  version "4.5.0"
-  resolved "https://registry.yarnpkg.com/lodash.clonedeep/-/lodash.clonedeep-4.5.0.tgz#e23f3f9c4f8fbdde872529c1071857a086e5ccef"
-  integrity sha1-4j8/nE+Pvd6HJSnBBxhXoIblzO8=
-
-lodash.flattendeep@^4.4.0:
-  version "4.4.0"
-  resolved "https://registry.yarnpkg.com/lodash.flattendeep/-/lodash.flattendeep-4.4.0.tgz#fb030917f86a3134e5bc9bec0d69e0013ddfedb2"
-  integrity sha1-+wMJF/hqMTTlvJvsDWngAT3f7bI=
-
-lodash.islength@^4.0.1:
-  version "4.0.1"
-  resolved "https://registry.yarnpkg.com/lodash.islength/-/lodash.islength-4.0.1.tgz#4e9868d452575d750affd358c979543dc20ed577"
-  integrity sha1-Tpho1FJXXXUK/9NYyXlUPcIO1Xc=
-
-lodash.merge@^4.6.1:
-  version "4.6.2"
-  resolved "https://registry.yarnpkg.com/lodash.merge/-/lodash.merge-4.6.2.tgz#558aa53b43b661e1925a0afdfa36a9a1085fe57a"
-  integrity sha512-0KpjqXRVvrYyCsX1swR/XTK0va6VQkQM6MNo7PqW77ByjAhoARA8EfrP1N4+KlKj8YS0ZUCtRT/YUuhyYDujIQ==
-
-lodash@^4.17.13, lodash@^4.17.15:
-  version "4.17.15"
-  resolved "https://registry.yarnpkg.com/lodash/-/lodash-4.17.15.tgz#b447f6670a0455bbfeedd11392eff330ea097548"
-  integrity sha512-8xOcRHvCjnocdS5cpwXQXVzmmh5e5+saE2QGoeQmbKmRS6J3VQppPOIt0MnmE+4xlZoumy0GPG0D0MVIQbNA1A==
-
-log-symbols@^2.2.0:
-  version "2.2.0"
-  resolved "https://registry.yarnpkg.com/log-symbols/-/log-symbols-2.2.0.tgz#5740e1c5d6f0dfda4ad9323b5332107ef6b4c40a"
-  integrity sha512-VeIAFslyIerEJLXHziedo2basKbMKtTw3vfn5IzG0XTjhAVEJyNHnL2p7vc+wBDSdQuUpNw3M2u6xb9QsAY5Eg==
-  dependencies:
-    chalk "^2.0.1"
-
-loud-rejection@^1.0.0:
-  version "1.6.0"
-  resolved "https://registry.yarnpkg.com/loud-rejection/-/loud-rejection-1.6.0.tgz#5b46f80147edee578870f086d04821cf998e551f"
-  integrity sha1-W0b4AUft7leIcPCG0Eghz5mOVR8=
-  dependencies:
-    currently-unhandled "^0.4.1"
-    signal-exit "^3.0.0"
-
-loud-rejection@^2.1.0:
-  version "2.1.0"
-  resolved "https://registry.yarnpkg.com/loud-rejection/-/loud-rejection-2.1.0.tgz#4020547ddbc39ed711c8434326df9fc7d2395355"
-  integrity sha512-g/6MQxUXYHeVqZ4PGpPL1fS1fOvlXoi7bay0pizmjAd/3JhyXwxzwrnr74yzdmhuerlslbRJ3x7IOXzFz0cE5w==
-  dependencies:
-    currently-unhandled "^0.4.1"
-    signal-exit "^3.0.2"
-
-lowercase-keys@^1.0.0, lowercase-keys@^1.0.1:
-  version "1.0.1"
-  resolved "https://registry.yarnpkg.com/lowercase-keys/-/lowercase-keys-1.0.1.tgz#6f9e30b47084d971a7c820ff15a6c5167b74c26f"
-  integrity sha512-G2Lj61tXDnVFFOi8VZds+SoQjtQC3dgokKdDG2mTm1tx4m50NUHBOZSBwQQHyy0V12A0JTG4icfZQH+xPyh8VA==
-
-lowercase-keys@^2.0.0:
-  version "2.0.0"
-  resolved "https://registry.yarnpkg.com/lowercase-keys/-/lowercase-keys-2.0.0.tgz#2603e78b7b4b0006cbca2fbcc8a3202558ac9479"
-  integrity sha512-tqNXrS78oMOE73NMxK4EMLQsQowWf8jKooH9g7xPavRT706R6bkQJ6DY2Te7QukaZsulxa30wQ7bk0pm4XiHmA==
-
-lru-cache@^4.0.1:
-  version "4.1.5"
-  resolved "https://registry.yarnpkg.com/lru-cache/-/lru-cache-4.1.5.tgz#8bbe50ea85bed59bc9e33dcab8235ee9bcf443cd"
-  integrity sha512-sWZlbEP2OsHNkXrMl5GYk/jKk70MBng6UU4YI/qGDYbgf6YbP4EvmqISbXCoJiRKs+1bSpFHVgQxvJ17F2li5g==
-  dependencies:
-    pseudomap "^1.0.2"
-    yallist "^2.1.2"
-
-make-dir@^1.0.0:
-  version "1.3.0"
-  resolved "https://registry.yarnpkg.com/make-dir/-/make-dir-1.3.0.tgz#79c1033b80515bd6d24ec9933e860ca75ee27f0c"
-  integrity sha512-2w31R7SJtieJJnQtGc7RVL2StM2vGYVfqUOvUDxH6bC6aJTxPxTF0GnIgCyu7tjockiUWAYQRbxa7vKn34s5sQ==
-  dependencies:
-    pify "^3.0.0"
-
-make-dir@^3.0.0:
-  version "3.0.0"
-  resolved "https://registry.yarnpkg.com/make-dir/-/make-dir-3.0.0.tgz#1b5f39f6b9270ed33f9f054c5c0f84304989f801"
-  integrity sha512-grNJDhb8b1Jm1qeqW5R/O63wUo4UXo2v2HMic6YT9i/HBlF93S8jkMgH7yugvY9ABDShH4VZMn8I+U8+fCNegw==
-  dependencies:
-    semver "^6.0.0"
-
-map-obj@^1.0.0:
-  version "1.0.1"
-  resolved "https://registry.yarnpkg.com/map-obj/-/map-obj-1.0.1.tgz#d933ceb9205d82bdcf4886f6742bdc2b4dea146d"
-  integrity sha1-2TPOuSBdgr3PSIb2dCvcK03qFG0=
-
-map-obj@^2.0.0:
-  version "2.0.0"
-  resolved "https://registry.yarnpkg.com/map-obj/-/map-obj-2.0.0.tgz#a65cd29087a92598b8791257a523e021222ac1f9"
-  integrity sha1-plzSkIepJZi4eRJXpSPgISIqwfk=
-
-matcher@^2.0.0:
-  version "2.0.0"
-  resolved "https://registry.yarnpkg.com/matcher/-/matcher-2.0.0.tgz#85fe38d97670dbd2a46590cf099401e2ffb4755c"
-  integrity sha512-nlmfSlgHBFx36j/Pl/KQPbIaqE8Zf0TqmSMjsuddHDg6PMSVgmyW9HpkLs0o0M1n2GIZ/S2BZBLIww/xjhiGng==
-  dependencies:
-    escape-string-regexp "^2.0.0"
-
-md5-hex@^2.0.0:
-  version "2.0.0"
-  resolved "https://registry.yarnpkg.com/md5-hex/-/md5-hex-2.0.0.tgz#d0588e9f1c74954492ecd24ac0ac6ce997d92e33"
-  integrity sha1-0FiOnxx0lUSS7NJKwKxs6ZfZLjM=
-  dependencies:
-    md5-o-matic "^0.1.1"
-
-md5-hex@^3.0.1:
-  version "3.0.1"
-  resolved "https://registry.yarnpkg.com/md5-hex/-/md5-hex-3.0.1.tgz#be3741b510591434b2784d79e556eefc2c9a8e5c"
-  integrity sha512-BUiRtTtV39LIJwinWBjqVsU9xhdnz7/i889V859IBFpuqGAj6LuOvHv5XLbgZ2R7ptJoJaEcxkv88/h25T7Ciw==
-  dependencies:
-    blueimp-md5 "^2.10.0"
-
-md5-o-matic@^0.1.1:
-  version "0.1.1"
-  resolved "https://registry.yarnpkg.com/md5-o-matic/-/md5-o-matic-0.1.1.tgz#822bccd65e117c514fab176b25945d54100a03c3"
-  integrity sha1-givM1l4RfFFPqxdrJZRdVBAKA8M=
-
-meow@^5.0.0:
-  version "5.0.0"
-  resolved "https://registry.yarnpkg.com/meow/-/meow-5.0.0.tgz#dfc73d63a9afc714a5e371760eb5c88b91078aa4"
-  integrity sha512-CbTqYU17ABaLefO8vCU153ZZlprKYWDljcndKKDCFcYQITzWCXZAVk4QMFZPgvzrnUQ3uItnIE/LoUOwrT15Ig==
-  dependencies:
-    camelcase-keys "^4.0.0"
-    decamelize-keys "^1.0.0"
-    loud-rejection "^1.0.0"
-    minimist-options "^3.0.1"
-    normalize-package-data "^2.3.4"
-    read-pkg-up "^3.0.0"
-    redent "^2.0.0"
-    trim-newlines "^2.0.0"
-    yargs-parser "^10.0.0"
-
-merge2@^1.2.3:
-  version "1.2.4"
-  resolved "https://registry.yarnpkg.com/merge2/-/merge2-1.2.4.tgz#c9269589e6885a60cf80605d9522d4b67ca646e3"
-  integrity sha512-FYE8xI+6pjFOhokZu0We3S5NKCirLbCzSh2Usf3qEyr4X8U+0jNg9P8RZ4qz+V2UoECLVwSyzU3LxXBaLGtD3A==
-
-micromatch@^4.0.2:
-  version "4.0.2"
-  resolved "https://registry.yarnpkg.com/micromatch/-/micromatch-4.0.2.tgz#4fcb0999bf9fbc2fcbdd212f6d629b9a56c39259"
-  integrity sha512-y7FpHSbMUMoyPbYUSzO6PaZ6FyRnQOpHuKwbo1G+Knck95XVU4QAiKdGEnj5wwoS7PlOgthX/09u5iFJ+aYf5Q==
-  dependencies:
-    braces "^3.0.1"
-    picomatch "^2.0.5"
-
-mimic-fn@^1.0.0:
-  version "1.2.0"
-  resolved "https://registry.yarnpkg.com/mimic-fn/-/mimic-fn-1.2.0.tgz#820c86a39334640e99516928bd03fca88057d022"
-  integrity sha512-jf84uxzwiuiIVKiOLpfYk7N46TSy8ubTonmneY9vrpHNAnp0QBt2BxWV9dO3/j+BoVAb+a5G6YDPW3M5HOdMWQ==
-
-mimic-fn@^2.1.0:
-  version "2.1.0"
-  resolved "https://registry.yarnpkg.com/mimic-fn/-/mimic-fn-2.1.0.tgz#7ed2c2ccccaf84d3ffcb7a69b57711fc2083401b"
-  integrity sha512-OqbOk5oEQeAZ8WXWydlu9HJjz9WVdEIvamMCcXmuqUYjTknH/sqsWvhQ3vgwKFRR1HpjvNBKQ37nbJgYzGqGcg==
-
-mimic-response@^1.0.0, mimic-response@^1.0.1:
-  version "1.0.1"
-  resolved "https://registry.yarnpkg.com/mimic-response/-/mimic-response-1.0.1.tgz#4923538878eef42063cb8a3e3b0798781487ab1b"
-  integrity sha512-j5EctnkH7amfV/q5Hgmoal1g2QHFJRraOtmx0JpIqkxhBhI/lJSl1nMpQ45hVarwNETOoWEimndZ4QK0RHxuxQ==
-
-minimatch@^3.0.4:
-  version "3.0.4"
-  resolved "https://registry.yarnpkg.com/minimatch/-/minimatch-3.0.4.tgz#5166e286457f03306064be5497e8dbb0c3d32083"
-  integrity sha512-yJHVQEhyqPLUTgt9B83PXu6W3rx4MvvHvSUvToogpwoGDOUQ+yDrR0HRot+yOCdCO7u4hX3pWft6kWBBcqh0UA==
-  dependencies:
-    brace-expansion "^1.1.7"
-
-minimist-options@^3.0.1:
-  version "3.0.2"
-  resolved "https://registry.yarnpkg.com/minimist-options/-/minimist-options-3.0.2.tgz#fba4c8191339e13ecf4d61beb03f070103f3d954"
-  integrity sha512-FyBrT/d0d4+uiZRbqznPXqw3IpZZG3gl3wKWiX784FycUKVwBt0uLBFkQrtE4tZOrgo78nZp2jnKz3L65T5LdQ==
-  dependencies:
-    arrify "^1.0.1"
-    is-plain-obj "^1.1.0"
-
-minimist@0.0.8:
-  version "0.0.8"
-  resolved "https://registry.yarnpkg.com/minimist/-/minimist-0.0.8.tgz#857fcabfc3397d2625b8228262e86aa7a011b05d"
-  integrity sha1-hX/Kv8M5fSYluCKCYuhqp6ARsF0=
-
-minimist@^1.2.0:
-  version "1.2.0"
-  resolved "https://registry.yarnpkg.com/minimist/-/minimist-1.2.0.tgz#a35008b20f41383eec1fb914f4cd5df79a264284"
-  integrity sha1-o1AIsg9BOD7sH7kU9M1d95omQoQ=
-
-mkdirp@^0.5.1:
-  version "0.5.1"
-  resolved "https://registry.yarnpkg.com/mkdirp/-/mkdirp-0.5.1.tgz#30057438eac6cf7f8c4767f38648d6697d75c903"
-  integrity sha1-MAV0OOrGz3+MR2fzhkjWaX11yQM=
-  dependencies:
-    minimist "0.0.8"
-
-ms@^2.1.1, ms@^2.1.2:
-  version "2.1.2"
-  resolved "https://registry.yarnpkg.com/ms/-/ms-2.1.2.tgz#d09d1f357b443f493382a8eb3ccd183872ae6009"
-  integrity sha512-sGkPx+VjMtmA6MX27oA4FBFELFCZZ4S4XqeGOXCv68tT+jb3vk/RyaKWP0PTKyWtmLSM0b+adUTEvbs1PEaH2w==
-
-normalize-package-data@^2.3.2, normalize-package-data@^2.3.4:
-  version "2.5.0"
-  resolved "https://registry.yarnpkg.com/normalize-package-data/-/normalize-package-data-2.5.0.tgz#e66db1838b200c1dfc233225d12cb36520e234a8"
-  integrity sha512-/5CMN3T0R4XTj4DcGaexo+roZSdSFW/0AOOTROrjxzCG1wrWXEsGbRKevjlIL+ZDE4sZlJr5ED4YW0yqmkK+eA==
-  dependencies:
-    hosted-git-info "^2.1.4"
-    resolve "^1.10.0"
-    semver "2 || 3 || 4 || 5"
-    validate-npm-package-license "^3.0.1"
-
-normalize-path@^3.0.0:
-  version "3.0.0"
-  resolved "https://registry.yarnpkg.com/normalize-path/-/normalize-path-3.0.0.tgz#0dcd69ff23a1c9b11fd0978316644a0388216a65"
-  integrity sha512-6eZs5Ls3WtCisHWp9S2GUy8dqkpGi4BVSz3GaqiE6ezub0512ESztXUwUB6C6IKbQkY2Pnb/mD4WYojCRwcwLA==
-
-normalize-url@^4.1.0:
-  version "4.3.0"
-  resolved "https://registry.yarnpkg.com/normalize-url/-/normalize-url-4.3.0.tgz#9c49e10fc1876aeb76dba88bf1b2b5d9fa57b2ee"
-  integrity sha512-0NLtR71o4k6GLP+mr6Ty34c5GA6CMoEsncKJxvQd8NzPxaHRJNnb5gZE8R1XF4CPIS7QPHLJ74IFszwtNVAHVQ==
-
-npm-run-path@^2.0.0:
-  version "2.0.2"
-  resolved "https://registry.yarnpkg.com/npm-run-path/-/npm-run-path-2.0.2.tgz#35a9232dfa35d7067b4cb2ddf2357b1871536c5f"
-  integrity sha1-NakjLfo11wZ7TLLd8jV7GHFTbF8=
-  dependencies:
-    path-key "^2.0.0"
-
-object-assign@^4.0.1:
-  version "4.1.1"
-  resolved "https://registry.yarnpkg.com/object-assign/-/object-assign-4.1.1.tgz#2109adc7965887cfc05cbbd442cac8bfbb360863"
-  integrity sha1-IQmtx5ZYh8/AXLvUQsrIv7s2CGM=
-
-object-keys@^1.0.11, object-keys@^1.0.12:
-  version "1.1.1"
-  resolved "https://registry.yarnpkg.com/object-keys/-/object-keys-1.1.1.tgz#1c47f272df277f3b1daf061677d9c82e2322c60e"
-  integrity sha512-NuAESUOUMrlIXOfHKzD6bpPu3tYt3xvjNdRIQ+FeT0lNb4K8WR70CaDxhuNguS2XG+GjkyMwOzsN5ZktImfhLA==
-
-object.assign@^4.1.0:
-  version "4.1.0"
-  resolved "https://registry.yarnpkg.com/object.assign/-/object.assign-4.1.0.tgz#968bf1100d7956bb3ca086f006f846b3bc4008da"
-  integrity sha512-exHJeq6kBKj58mqGyTQ9DFvrZC/eR6OwxzoM9YRoGBqrXYonaFyGiFMuc9VZrXf7DarreEwMpurG3dd+CNyW5w==
-  dependencies:
-    define-properties "^1.1.2"
-    function-bind "^1.1.1"
-    has-symbols "^1.0.0"
-    object-keys "^1.0.11"
-
-observable-to-promise@^1.0.0:
-  version "1.0.0"
-  resolved "https://registry.yarnpkg.com/observable-to-promise/-/observable-to-promise-1.0.0.tgz#37e136f16a15385ac063411ada0e1202bfff58f4"
-  integrity sha512-cqnGUrNsE6vdVDTPAX9/WeVzwy/z37vdxupdQXU8vgTXRFH72KCZiZga8aca2ulRPIeem8W3vW9rQHBwfIl2WA==
-  dependencies:
-    is-observable "^2.0.0"
-    symbol-observable "^1.0.4"
-
-once@^1.3.0, once@^1.3.1, once@^1.4.0:
-  version "1.4.0"
-  resolved "https://registry.yarnpkg.com/once/-/once-1.4.0.tgz#583b1aa775961d4b113ac17d9c50baef9dd76bd1"
-  integrity sha1-WDsap3WWHUsROsF9nFC6753Xa9E=
-  dependencies:
-    wrappy "1"
-
-onetime@^2.0.0:
-  version "2.0.1"
-  resolved "https://registry.yarnpkg.com/onetime/-/onetime-2.0.1.tgz#067428230fd67443b2794b22bba528b6867962d4"
-  integrity sha1-BnQoIw/WdEOyeUsiu6UotoZ5YtQ=
-  dependencies:
-    mimic-fn "^1.0.0"
-
-onetime@^5.1.0:
-  version "5.1.0"
-  resolved "https://registry.yarnpkg.com/onetime/-/onetime-5.1.0.tgz#fff0f3c91617fe62bb50189636e99ac8a6df7be5"
-  integrity sha512-5NcSkPHhwTVFIQN+TUqXoS5+dlElHXdpAWu9I0HP20YOtIi+aZ0Ct82jdlILDxjLEAWwvm+qj1m6aEtsDVmm6Q==
-  dependencies:
-    mimic-fn "^2.1.0"
-
-ora@^3.4.0:
-  version "3.4.0"
-  resolved "https://registry.yarnpkg.com/ora/-/ora-3.4.0.tgz#bf0752491059a3ef3ed4c85097531de9fdbcd318"
-  integrity sha512-eNwHudNbO1folBP3JsZ19v9azXWtQZjICdr3Q0TDPIaeBQ3mXLrh54wM+er0+hSp+dWKf+Z8KM58CYzEyIYxYg==
-  dependencies:
-    chalk "^2.4.2"
-    cli-cursor "^2.1.0"
-    cli-spinners "^2.0.0"
-    log-symbols "^2.2.0"
-    strip-ansi "^5.2.0"
-    wcwidth "^1.0.1"
-
-os-tmpdir@^1.0.1:
-  version "1.0.2"
-  resolved "https://registry.yarnpkg.com/os-tmpdir/-/os-tmpdir-1.0.2.tgz#bbe67406c79aa85c5cfec766fe5734555dfa1274"
-  integrity sha1-u+Z0BseaqFxc/sdm/lc0VV36EnQ=
-
-p-cancelable@^1.0.0:
-  version "1.1.0"
-  resolved "https://registry.yarnpkg.com/p-cancelable/-/p-cancelable-1.1.0.tgz#d078d15a3af409220c886f1d9a0ca2e441ab26cc"
-  integrity sha512-s73XxOZ4zpt1edZYZzvhqFa6uvQc1vwUa0K0BdtIZgQMAJj9IbebH+JkgKZc9h+B05PKHLOTl4ajG1BmNrVZlw==
-
-p-finally@^1.0.0:
-  version "1.0.0"
-  resolved "https://registry.yarnpkg.com/p-finally/-/p-finally-1.0.0.tgz#3fbcfb15b899a44123b34b6dcc18b724336a2cae"
-  integrity sha1-P7z7FbiZpEEjs0ttzBi3JDNqLK4=
-
-p-limit@^1.1.0:
-  version "1.3.0"
-  resolved "https://registry.yarnpkg.com/p-limit/-/p-limit-1.3.0.tgz#b86bd5f0c25690911c7590fcbfc2010d54b3ccb8"
-  integrity sha512-vvcXsLAJ9Dr5rQOPk7toZQZJApBl2K4J6dANSsEuh6QI41JYcsS/qhTGa9ErIUUgK3WNQoJYvylxvjqmiqEA9Q==
-  dependencies:
-    p-try "^1.0.0"
-
-p-limit@^2.0.0, p-limit@^2.2.0:
-  version "2.2.0"
-  resolved "https://registry.yarnpkg.com/p-limit/-/p-limit-2.2.0.tgz#417c9941e6027a9abcba5092dd2904e255b5fbc2"
-  integrity sha512-pZbTJpoUsCzV48Mc9Nh51VbwO0X9cuPFE8gYwx9BTCt9SF8/b7Zljd2fVgOxhIF/HDTKgpVzs+GPhyKfjLLFRQ==
-  dependencies:
-    p-try "^2.0.0"
-
-p-locate@^2.0.0:
-  version "2.0.0"
-  resolved "https://registry.yarnpkg.com/p-locate/-/p-locate-2.0.0.tgz#20a0103b222a70c8fd39cc2e580680f3dde5ec43"
-  integrity sha1-IKAQOyIqcMj9OcwuWAaA893l7EM=
-  dependencies:
-    p-limit "^1.1.0"
-
-p-locate@^3.0.0:
-  version "3.0.0"
-  resolved "https://registry.yarnpkg.com/p-locate/-/p-locate-3.0.0.tgz#322d69a05c0264b25997d9f40cd8a891ab0064a4"
-  integrity sha512-x+12w/To+4GFfgJhBEpiDcLozRJGegY+Ei7/z0tSLkMmxGZNybVMSfWj9aJn8Z5Fc7dBUNJOOVgPv2H7IwulSQ==
-  dependencies:
-    p-limit "^2.0.0"
-
-p-locate@^4.1.0:
-  version "4.1.0"
-  resolved "https://registry.yarnpkg.com/p-locate/-/p-locate-4.1.0.tgz#a3428bb7088b3a60292f66919278b7c297ad4f07"
-  integrity sha512-R79ZZ/0wAxKGu3oYMlz8jy/kbhsNrS7SKZ7PxEHBgJ5+F2mtFW2fK2cOtBh1cHYkQsbzFV7I+EoRKe6Yt0oK7A==
-  dependencies:
-    p-limit "^2.2.0"
-
-p-map@^2.0.0:
-  version "2.1.0"
-  resolved "https://registry.yarnpkg.com/p-map/-/p-map-2.1.0.tgz#310928feef9c9ecc65b68b17693018a665cea175"
-  integrity sha512-y3b8Kpd8OAN444hxfBbFfj1FY/RjtTd8tzYwhUqNYXx0fXx2iX4maP4Qr6qhIKbQXI02wTLAda4fYUbDagTUFw==
-
-p-try@^1.0.0:
-  version "1.0.0"
-  resolved "https://registry.yarnpkg.com/p-try/-/p-try-1.0.0.tgz#cbc79cdbaf8fd4228e13f621f2b1a237c1b207b3"
-  integrity sha1-y8ec26+P1CKOE/Yh8rGiN8GyB7M=
-
-p-try@^2.0.0:
-  version "2.2.0"
-  resolved "https://registry.yarnpkg.com/p-try/-/p-try-2.2.0.tgz#cb2868540e313d61de58fafbe35ce9004d5540e6"
-  integrity sha512-R4nPAVTAU0B9D35/Gk3uJf/7XYbQcyohSKdvAxIRSNghFl4e71hVoGnBNQz9cWaXxO2I10KTC+3jMdvvoKw6dQ==
-
-package-hash@^4.0.0:
-  version "4.0.0"
-  resolved "https://registry.yarnpkg.com/package-hash/-/package-hash-4.0.0.tgz#3537f654665ec3cc38827387fc904c163c54f506"
-  integrity sha512-whdkPIooSu/bASggZ96BWVvZTRMOFxnyUG5PnTSGKoJE2gd5mbVNmR2Nj20QFzxYYgAXpoqC+AiXzl+UMRh7zQ==
-  dependencies:
-    graceful-fs "^4.1.15"
-    hasha "^5.0.0"
-    lodash.flattendeep "^4.4.0"
-    release-zalgo "^1.0.0"
-
-package-json@^6.3.0:
-  version "6.5.0"
-  resolved "https://registry.yarnpkg.com/package-json/-/package-json-6.5.0.tgz#6feedaca35e75725876d0b0e64974697fed145b0"
-  integrity sha512-k3bdm2n25tkyxcjSKzB5x8kfVxlMdgsbPr0GkZcwHsLpba6cBjqCt1KlcChKEvxHIcTB1FVMuwoijZ26xex5MQ==
-  dependencies:
-    got "^9.6.0"
-    registry-auth-token "^4.0.0"
-    registry-url "^5.0.0"
-    semver "^6.2.0"
-
-parse-json@^4.0.0:
-  version "4.0.0"
-  resolved "https://registry.yarnpkg.com/parse-json/-/parse-json-4.0.0.tgz#be35f5425be1f7f6c747184f98a788cb99477ee0"
-  integrity sha1-vjX1Qlvh9/bHRxhPmKeIy5lHfuA=
-  dependencies:
-    error-ex "^1.3.1"
-    json-parse-better-errors "^1.0.1"
-
-parse-ms@^2.1.0:
-  version "2.1.0"
-  resolved "https://registry.yarnpkg.com/parse-ms/-/parse-ms-2.1.0.tgz#348565a753d4391fa524029956b172cb7753097d"
-  integrity sha512-kHt7kzLoS9VBZfUsiKjv43mr91ea+U05EyKkEtqp7vNbHxmaVuEqN7XxeEVnGrMtYOAxGrDElSi96K7EgO1zCA==
-
-path-exists@^3.0.0:
-  version "3.0.0"
-  resolved "https://registry.yarnpkg.com/path-exists/-/path-exists-3.0.0.tgz#ce0ebeaa5f78cb18925ea7d810d7b59b010fd515"
-  integrity sha1-zg6+ql94yxiSXqfYENe1mwEP1RU=
-
-path-exists@^4.0.0:
-  version "4.0.0"
-  resolved "https://registry.yarnpkg.com/path-exists/-/path-exists-4.0.0.tgz#513bdbe2d3b95d7762e8c1137efa195c6c61b5b3"
-  integrity sha512-ak9Qy5Q7jYb2Wwcey5Fpvg2KoAc/ZIhLSLOSBmRmygPsGwkVVt0fZa0qrtMz+m6tJTAHfZQ8FnmB4MG4LWy7/w==
-
-path-is-absolute@^1.0.0:
-  version "1.0.1"
-  resolved "https://registry.yarnpkg.com/path-is-absolute/-/path-is-absolute-1.0.1.tgz#174b9268735534ffbc7ace6bf53a5a9e1b5c5f5f"
-  integrity sha1-F0uSaHNVNP+8es5r9TpanhtcX18=
-
-path-is-inside@^1.0.1, path-is-inside@^1.0.2:
-  version "1.0.2"
-  resolved "https://registry.yarnpkg.com/path-is-inside/-/path-is-inside-1.0.2.tgz#365417dede44430d1c11af61027facf074bdfc53"
-  integrity sha1-NlQX3t5EQw0cEa9hAn+s8HS9/FM=
-
-path-key@^2.0.0:
-  version "2.0.1"
-  resolved "https://registry.yarnpkg.com/path-key/-/path-key-2.0.1.tgz#411cadb574c5a140d3a4b1910d40d80cc9f40b40"
-  integrity sha1-QRyttXTFoUDTpLGRDUDYDMn0C0A=
-
-path-parse@^1.0.6:
-  version "1.0.6"
-  resolved "https://registry.yarnpkg.com/path-parse/-/path-parse-1.0.6.tgz#d62dbb5679405d72c4737ec58600e9ddcf06d24c"
-  integrity sha512-GSmOT2EbHrINBf9SR7CDELwlJ8AENk3Qn7OikK4nFYAu3Ote2+JYNVvkpAEQm3/TLNEJFD/xZJjzyxg3KBWOzw==
-
-path-type@^3.0.0:
-  version "3.0.0"
-  resolved "https://registry.yarnpkg.com/path-type/-/path-type-3.0.0.tgz#cef31dc8e0a1a3bb0d105c0cd97cf3bf47f4e36f"
-  integrity sha512-T2ZUsdZFHgA3u4e5PfPbjd7HDDpxPnQb5jN0SrDsjNSuVXHJqtwTnWqG0B1jZrgmJ/7lj1EmVIByWt1gxGkWvg==
-  dependencies:
-    pify "^3.0.0"
-
-path-type@^4.0.0:
-  version "4.0.0"
-  resolved "https://registry.yarnpkg.com/path-type/-/path-type-4.0.0.tgz#84ed01c0a7ba380afe09d90a8c180dcd9d03043b"
-  integrity sha512-gDKb8aZMDeD/tZWs9P6+q0J9Mwkdl6xMV8TjnGP3qJVJ06bdMgkbBlLU8IdfOsIsFz2BW1rNVT3XuNEl8zPAvw==
-
-picomatch@^2.0.4, picomatch@^2.0.5:
-  version "2.0.7"
-  resolved "https://registry.yarnpkg.com/picomatch/-/picomatch-2.0.7.tgz#514169d8c7cd0bdbeecc8a2609e34a7163de69f6"
-  integrity sha512-oLHIdio3tZ0qH76NybpeneBhYVj0QFTfXEFTc/B3zKQspYfYYkWYgFsmzo+4kvId/bQRcNkVeguI3y+CD22BtA==
-
-pify@^2.0.0:
-  version "2.3.0"
-  resolved "https://registry.yarnpkg.com/pify/-/pify-2.3.0.tgz#ed141a6ac043a849ea588498e7dca8b15330e90c"
-  integrity sha1-7RQaasBDqEnqWISY59yosVMw6Qw=
-
-pify@^3.0.0:
-  version "3.0.0"
-  resolved "https://registry.yarnpkg.com/pify/-/pify-3.0.0.tgz#e5a4acd2c101fdf3d9a4d07f0dbc4db49dd28176"
-  integrity sha1-5aSs0sEB/fPZpNB/DbxNtJ3SgXY=
-
-pify@^4.0.1:
-  version "4.0.1"
-  resolved "https://registry.yarnpkg.com/pify/-/pify-4.0.1.tgz#4b2cd25c50d598735c50292224fd8c6df41e3231"
-  integrity sha512-uB80kBFb/tfd68bVleG9T5GGsGPjJrLAUpR5PZIrhBnIaRTQRjqdJSsIKkOP6OAIFbj7GOrcudc5pNjZ+geV2g==
-
-pinkie-promise@^2.0.0:
-  version "2.0.1"
-  resolved "https://registry.yarnpkg.com/pinkie-promise/-/pinkie-promise-2.0.1.tgz#2135d6dfa7a358c069ac9b178776288228450ffa"
-  integrity sha1-ITXW36ejWMBprJsXh3YogihFD/o=
-  dependencies:
-    pinkie "^2.0.0"
-
-pinkie@^2.0.0:
-  version "2.0.4"
-  resolved "https://registry.yarnpkg.com/pinkie/-/pinkie-2.0.4.tgz#72556b80cfa0d48a974e80e77248e80ed4f7f870"
-  integrity sha1-clVrgM+g1IqXToDnckjoDtT3+HA=
-
-pkg-conf@^3.1.0:
-  version "3.1.0"
-  resolved "https://registry.yarnpkg.com/pkg-conf/-/pkg-conf-3.1.0.tgz#d9f9c75ea1bae0e77938cde045b276dac7cc69ae"
-  integrity sha512-m0OTbR/5VPNPqO1ph6Fqbj7Hv6QU7gR/tQW40ZqrL1rjgCU85W6C1bJn0BItuJqnR98PWzw7Z8hHeChD1WrgdQ==
-  dependencies:
-    find-up "^3.0.0"
-    load-json-file "^5.2.0"
-
-pkg-dir@^4.2.0:
-  version "4.2.0"
-  resolved "https://registry.yarnpkg.com/pkg-dir/-/pkg-dir-4.2.0.tgz#f099133df7ede422e81d1d8448270eeb3e4261f3"
-  integrity sha512-HRDzbaKjC+AOWVXxAU/x54COGeIv9eb+6CkDSQoNTt4XyWoIJvuPsXizxu/Fr23EiekbtZwmh1IcIG/l/a10GQ==
-  dependencies:
-    find-up "^4.0.0"
-
-plur@^3.1.1:
-  version "3.1.1"
-  resolved "https://registry.yarnpkg.com/plur/-/plur-3.1.1.tgz#60267967866a8d811504fe58f2faaba237546a5b"
-  integrity sha512-t1Ax8KUvV3FFII8ltczPn2tJdjqbd1sIzu6t4JL7nQ3EyeL/lTrj5PWKb06ic5/6XYDr65rQ4uzQEGN70/6X5w==
-  dependencies:
-    irregular-plurals "^2.0.0"
-
-prepend-http@^2.0.0:
-  version "2.0.0"
-  resolved "https://registry.yarnpkg.com/prepend-http/-/prepend-http-2.0.0.tgz#e92434bfa5ea8c19f41cdfd401d741a3c819d897"
-  integrity sha1-6SQ0v6XqjBn0HN/UAddBo8gZ2Jc=
-
-pretty-ms@^5.0.0:
-  version "5.0.0"
-  resolved "https://registry.yarnpkg.com/pretty-ms/-/pretty-ms-5.0.0.tgz#6133a8f55804b208e4728f6aa7bf01085e951e24"
-  integrity sha512-94VRYjL9k33RzfKiGokPBPpsmloBYSf5Ri+Pq19zlsEcUKFob+admeXr5eFDRuPjFmEOcjJvPGdillYOJyvZ7Q==
-  dependencies:
-    parse-ms "^2.1.0"
-
-pseudomap@^1.0.2:
-  version "1.0.2"
-  resolved "https://registry.yarnpkg.com/pseudomap/-/pseudomap-1.0.2.tgz#f052a28da70e618917ef0a8ac34c1ae5a68286b3"
-  integrity sha1-8FKijacOYYkX7wqKw0wa5aaChrM=
-
-pump@^3.0.0:
-  version "3.0.0"
-  resolved "https://registry.yarnpkg.com/pump/-/pump-3.0.0.tgz#b4a2116815bde2f4e1ea602354e8c75565107a64"
-  integrity sha512-LwZy+p3SFs1Pytd/jYct4wpv49HiYCqd9Rlc5ZVdk0V+8Yzv6jR5Blk3TRmPL1ft69TxP0IMZGJ+WPFU2BFhww==
-  dependencies:
-    end-of-stream "^1.1.0"
-    once "^1.3.1"
-
-quick-lru@^1.0.0:
-  version "1.1.0"
-  resolved "https://registry.yarnpkg.com/quick-lru/-/quick-lru-1.1.0.tgz#4360b17c61136ad38078397ff11416e186dcfbb8"
-  integrity sha1-Q2CxfGETatOAeDl/8RQW4Ybc+7g=
-
-rc@^1.2.8:
-  version "1.2.8"
-  resolved "https://registry.yarnpkg.com/rc/-/rc-1.2.8.tgz#cd924bf5200a075b83c188cd6b9e211b7fc0d3ed"
-  integrity sha512-y3bGgqKj3QBdxLbLkomlohkvsA8gdAiUQlSBJnBhfn+BPxg4bc62d8TcBW15wavDfgexCgccckhcZvywyQYPOw==
-  dependencies:
-    deep-extend "^0.6.0"
-    ini "~1.3.0"
-    minimist "^1.2.0"
-    strip-json-comments "~2.0.1"
-
-read-pkg-up@^3.0.0:
-  version "3.0.0"
-  resolved "https://registry.yarnpkg.com/read-pkg-up/-/read-pkg-up-3.0.0.tgz#3ed496685dba0f8fe118d0691dc51f4a1ff96f07"
-  integrity sha1-PtSWaF26D4/hGNBpHcUfSh/5bwc=
-  dependencies:
-    find-up "^2.0.0"
-    read-pkg "^3.0.0"
-
-read-pkg@^3.0.0:
-  version "3.0.0"
-  resolved "https://registry.yarnpkg.com/read-pkg/-/read-pkg-3.0.0.tgz#9cbc686978fee65d16c00e2b19c237fcf6e38389"
-  integrity sha1-nLxoaXj+5l0WwA4rGcI3/Pbjg4k=
-  dependencies:
-    load-json-file "^4.0.0"
-    normalize-package-data "^2.3.2"
-    path-type "^3.0.0"
-
-readdirp@^3.1.1:
-  version "3.1.2"
-  resolved "https://registry.yarnpkg.com/readdirp/-/readdirp-3.1.2.tgz#fa85d2d14d4289920e4671dead96431add2ee78a"
-  integrity sha512-8rhl0xs2cxfVsqzreYCvs8EwBfn/DhVdqtoLmw19uI3SC5avYX9teCurlErfpPXGmYtMHReGaP2RsLnFvz/lnw==
-  dependencies:
-    picomatch "^2.0.4"
-
-redent@^2.0.0:
-  version "2.0.0"
-  resolved "https://registry.yarnpkg.com/redent/-/redent-2.0.0.tgz#c1b2007b42d57eb1389079b3c8333639d5e1ccaa"
-  integrity sha1-wbIAe0LVfrE4kHmzyDM2OdXhzKo=
-  dependencies:
-    indent-string "^3.0.0"
-    strip-indent "^2.0.0"
-
-regenerate-unicode-properties@^8.1.0:
-  version "8.1.0"
-  resolved "https://registry.yarnpkg.com/regenerate-unicode-properties/-/regenerate-unicode-properties-8.1.0.tgz#ef51e0f0ea4ad424b77bf7cb41f3e015c70a3f0e"
-  integrity sha512-LGZzkgtLY79GeXLm8Dp0BVLdQlWICzBnJz/ipWUgo59qBaZ+BHtq51P2q1uVZlppMuUAT37SDk39qUbjTWB7bA==
-  dependencies:
-    regenerate "^1.4.0"
-
-regenerate@^1.4.0:
-  version "1.4.0"
-  resolved "https://registry.yarnpkg.com/regenerate/-/regenerate-1.4.0.tgz#4a856ec4b56e4077c557589cae85e7a4c8869a11"
-  integrity sha512-1G6jJVDWrt0rK99kBjvEtziZNCICAuvIPkSiUFIQxVP06RCVpq3dmDo2oi6ABpYaDYaTRr67BEhL8r1wgEZZKg==
-
-regexpu-core@^4.5.4:
-  version "4.5.5"
-  resolved "https://registry.yarnpkg.com/regexpu-core/-/regexpu-core-4.5.5.tgz#aaffe61c2af58269b3e516b61a73790376326411"
-  integrity sha512-FpI67+ky9J+cDizQUJlIlNZFKual/lUkFr1AG6zOCpwZ9cLrg8UUVakyUQJD7fCDIe9Z2nwTQJNPyonatNmDFQ==
-  dependencies:
-    regenerate "^1.4.0"
-    regenerate-unicode-properties "^8.1.0"
-    regjsgen "^0.5.0"
-    regjsparser "^0.6.0"
-    unicode-match-property-ecmascript "^1.0.4"
-    unicode-match-property-value-ecmascript "^1.1.0"
-
-registry-auth-token@^4.0.0:
-  version "4.0.0"
-  resolved "https://registry.yarnpkg.com/registry-auth-token/-/registry-auth-token-4.0.0.tgz#30e55961eec77379da551ea5c4cf43cbf03522be"
-  integrity sha512-lpQkHxd9UL6tb3k/aHAVfnVtn+Bcs9ob5InuFLLEDqSqeq+AljB8GZW9xY0x7F+xYwEcjKe07nyoxzEYz6yvkw==
-  dependencies:
-    rc "^1.2.8"
-    safe-buffer "^5.0.1"
-
-registry-url@^5.0.0:
-  version "5.1.0"
-  resolved "https://registry.yarnpkg.com/registry-url/-/registry-url-5.1.0.tgz#e98334b50d5434b81136b44ec638d9c2009c5009"
-  integrity sha512-8acYXXTI0AkQv6RAOjE3vOaIXZkT9wo4LOFbBKYQEEnnMNBpKqdUrI6S4NT0KPIo/WVvJ5tE/X5LF/TQUf0ekw==
-  dependencies:
-    rc "^1.2.8"
-
-regjsgen@^0.5.0:
-  version "0.5.0"
-  resolved "https://registry.yarnpkg.com/regjsgen/-/regjsgen-0.5.0.tgz#a7634dc08f89209c2049adda3525711fb97265dd"
-  integrity sha512-RnIrLhrXCX5ow/E5/Mh2O4e/oa1/jW0eaBKTSy3LaCj+M3Bqvm97GWDp2yUtzIs4LEn65zR2yiYGFqb2ApnzDA==
-
-regjsparser@^0.6.0:
-  version "0.6.0"
-  resolved "https://registry.yarnpkg.com/regjsparser/-/regjsparser-0.6.0.tgz#f1e6ae8b7da2bae96c99399b868cd6c933a2ba9c"
-  integrity sha512-RQ7YyokLiQBomUJuUG8iGVvkgOLxwyZM8k6d3q5SAXpg4r5TZJZigKFvC6PpD+qQ98bCDC5YelPeA3EucDoNeQ==
-  dependencies:
-    jsesc "~0.5.0"
-
-release-zalgo@^1.0.0:
-  version "1.0.0"
-  resolved "https://registry.yarnpkg.com/release-zalgo/-/release-zalgo-1.0.0.tgz#09700b7e5074329739330e535c5a90fb67851730"
-  integrity sha1-CXALflB0Mpc5Mw5TXFqQ+2eFFzA=
-  dependencies:
-    es6-error "^4.0.1"
-
-require-precompiled@^0.1.0:
-  version "0.1.0"
-  resolved "https://registry.yarnpkg.com/require-precompiled/-/require-precompiled-0.1.0.tgz#5a1b52eb70ebed43eb982e974c85ab59571e56fa"
-  integrity sha1-WhtS63Dr7UPrmC6XTIWrWVceVvo=
-
-resolve-cwd@^3.0.0:
-  version "3.0.0"
-  resolved "https://registry.yarnpkg.com/resolve-cwd/-/resolve-cwd-3.0.0.tgz#0f0075f1bb2544766cf73ba6a6e2adfebcb13f2d"
-  integrity sha512-OrZaX2Mb+rJCpH/6CpSqt9xFVpN++x01XnN2ie9g6P5/3xelLAkXWVADpdz1IHD/KFfEXyE6V0U01OQ3UO2rEg==
-  dependencies:
-    resolve-from "^5.0.0"
-
-resolve-from@^5.0.0:
-  version "5.0.0"
-  resolved "https://registry.yarnpkg.com/resolve-from/-/resolve-from-5.0.0.tgz#c35225843df8f776df21c57557bc087e9dfdfc69"
-  integrity sha512-qYg9KP24dD5qka9J47d0aVky0N+b4fTU89LN9iDnjB5waksiC49rvMB0PrUJQGoTmH50XPiqOvAjDfaijGxYZw==
-
-resolve@^1.10.0, resolve@^1.3.2:
-  version "1.12.0"
-  resolved "https://registry.yarnpkg.com/resolve/-/resolve-1.12.0.tgz#3fc644a35c84a48554609ff26ec52b66fa577df6"
-  integrity sha512-B/dOmuoAik5bKcD6s6nXDCjzUKnaDvdkRyAk6rsmsKLipWj4797iothd7jmmUhWTfinVMU+wc56rYKsit2Qy4w==
-  dependencies:
-    path-parse "^1.0.6"
-
-responselike@^1.0.2:
-  version "1.0.2"
-  resolved "https://registry.yarnpkg.com/responselike/-/responselike-1.0.2.tgz#918720ef3b631c5642be068f15ade5a46f4ba1e7"
-  integrity sha1-kYcg7ztjHFZCvgaPFa3lpG9Loec=
-  dependencies:
-    lowercase-keys "^1.0.0"
-
-restore-cursor@^2.0.0:
-  version "2.0.0"
-  resolved "https://registry.yarnpkg.com/restore-cursor/-/restore-cursor-2.0.0.tgz#9f7ee287f82fd326d4fd162923d62129eee0dfaf"
-  integrity sha1-n37ih/gv0ybU/RYpI9YhKe7g368=
-  dependencies:
-    onetime "^2.0.0"
-    signal-exit "^3.0.2"
-
-restore-cursor@^3.1.0:
-  version "3.1.0"
-  resolved "https://registry.yarnpkg.com/restore-cursor/-/restore-cursor-3.1.0.tgz#39f67c54b3a7a58cea5236d95cf0034239631f7e"
-  integrity sha512-l+sSefzHpj5qimhFSE5a8nufZYAM3sBSVMAPtYkmC+4EH2anSGaEMXSD0izRQbu9nfyQ9y5JrVmp7E8oZrUjvA==
-  dependencies:
-    onetime "^5.1.0"
-    signal-exit "^3.0.2"
-
-reusify@^1.0.0:
-  version "1.0.4"
-  resolved "https://registry.yarnpkg.com/reusify/-/reusify-1.0.4.tgz#90da382b1e126efc02146e90845a88db12925d76"
-  integrity sha512-U9nH88a3fc/ekCF1l0/UP1IosiuIjyTh7hBvXVMHYgVcfGvt897Xguj2UOLDeI5BG2m7/uwyaLVT6fbtCwTyzw==
-
-rimraf@^2.6.3:
-  version "2.7.1"
-  resolved "https://registry.yarnpkg.com/rimraf/-/rimraf-2.7.1.tgz#35797f13a7fdadc566142c29d4f07ccad483e3ec"
-  integrity sha512-uWjbaKIK3T1OSVptzX7Nl6PvQ3qAGtKEtVRjRuazjfL3Bx5eI409VZSqgND+4UNnmzLVdPj9FqFJNPqBZFve4w==
-  dependencies:
-    glob "^7.1.3"
-
-run-parallel@^1.1.9:
-  version "1.1.9"
-  resolved "https://registry.yarnpkg.com/run-parallel/-/run-parallel-1.1.9.tgz#c9dd3a7cf9f4b2c4b6244e173a6ed866e61dd679"
-  integrity sha512-DEqnSRTDw/Tc3FXf49zedI638Z9onwUotBMiUFKmrO2sdFKIbXamXGQ3Axd4qgphxKB4kw/qP1w5kTxnfU1B9Q==
-
-safe-buffer@^5.0.1:
-  version "5.2.0"
-  resolved "https://registry.yarnpkg.com/safe-buffer/-/safe-buffer-5.2.0.tgz#b74daec49b1148f88c64b68d49b1e815c1f2f519"
-  integrity sha512-fZEwUGbVl7kouZs1jCdMLdt95hdIv0ZeHg6L7qPeciMZhZ+/gdesW4wgTARkrFWEpspjEATAzUGPG8N2jJiwbg==
-
-safe-buffer@~5.1.1:
-  version "5.1.2"
-  resolved "https://registry.yarnpkg.com/safe-buffer/-/safe-buffer-5.1.2.tgz#991ec69d296e0313747d59bdfd2b745c35f8828d"
-  integrity sha512-Gd2UZBJDkXlY7GbJxfsE8/nvKkUEU1G38c1siN6QP6a9PT9MmHB8GnpscSmMJSoF8LOIrt8ud/wPtojys4G6+g==
-
-semver-diff@^2.0.0:
-  version "2.1.0"
-  resolved "https://registry.yarnpkg.com/semver-diff/-/semver-diff-2.1.0.tgz#4bbb8437c8d37e4b0cf1a68fd726ec6d645d6d36"
-  integrity sha1-S7uEN8jTfksM8aaP1ybsbWRdbTY=
-  dependencies:
-    semver "^5.0.3"
-
-"semver@2 || 3 || 4 || 5", semver@^5.0.3, semver@^5.4.1, semver@^5.5.1:
-  version "5.7.1"
-  resolved "https://registry.yarnpkg.com/semver/-/semver-5.7.1.tgz#a954f931aeba508d307bbf069eff0c01c96116f7"
-  integrity sha512-sauaDf/PZdVgrLTNYHRtpXa1iRiKcaebiKQ1BJdpQlWH2lCvexQdX55snPFyK7QzpudqbCI0qXFfOasHdyNDGQ==
-
-semver@^6.0.0, semver@^6.2.0:
-  version "6.3.0"
-  resolved "https://registry.yarnpkg.com/semver/-/semver-6.3.0.tgz#ee0a64c8af5e8ceea67687b133761e1becbd1d3d"
-  integrity sha512-b39TBaTSfV6yBrapU89p5fKekE2m/NwnDocOVruQFS1/veMgdzuPcnOM34M6CwxW8jH/lxEa5rBoDeUwu5HHTw==
-
-serialize-error@^2.1.0:
-  version "2.1.0"
-  resolved "https://registry.yarnpkg.com/serialize-error/-/serialize-error-2.1.0.tgz#50b679d5635cdf84667bdc8e59af4e5b81d5f60a"
-  integrity sha1-ULZ51WNc34Rme9yOWa9OW4HV9go=
-
-shebang-command@^1.2.0:
-  version "1.2.0"
-  resolved "https://registry.yarnpkg.com/shebang-command/-/shebang-command-1.2.0.tgz#44aac65b695b03398968c39f363fee5deafdf1ea"
-  integrity sha1-RKrGW2lbAzmJaMOfNj/uXer98eo=
-  dependencies:
-    shebang-regex "^1.0.0"
-
-shebang-regex@^1.0.0:
-  version "1.0.0"
-  resolved "https://registry.yarnpkg.com/shebang-regex/-/shebang-regex-1.0.0.tgz#da42f49740c0b42db2ca9728571cb190c98efea3"
-  integrity sha1-2kL0l0DAtC2yypcoVxyxkMmO/qM=
-
-signal-exit@^3.0.0, signal-exit@^3.0.2:
-  version "3.0.2"
-  resolved "https://registry.yarnpkg.com/signal-exit/-/signal-exit-3.0.2.tgz#b5fdc08f1287ea1178628e415e25132b73646c6d"
-  integrity sha1-tf3AjxKH6hF4Yo5BXiUTK3NkbG0=
-
-slash@^3.0.0:
-  version "3.0.0"
-  resolved "https://registry.yarnpkg.com/slash/-/slash-3.0.0.tgz#6539be870c165adbd5240220dbe361f1bc4d4634"
-  integrity sha512-g9Q1haeby36OSStwb4ntCGGGaKsaVSjQ68fBxoQcutl5fS1vuY18H3wSt3jFyFtrkx+Kz0V1G85A4MyAdDMi2Q==
-
-slice-ansi@^2.1.0:
-  version "2.1.0"
-  resolved "https://registry.yarnpkg.com/slice-ansi/-/slice-ansi-2.1.0.tgz#cacd7693461a637a5788d92a7dd4fba068e81636"
-  integrity sha512-Qu+VC3EwYLldKa1fCxuuvULvSJOKEgk9pi8dZeCVK7TqBfUNTH4sFkk4joj8afVSfAYgJoSOetjx9QWOJ5mYoQ==
-  dependencies:
-    ansi-styles "^3.2.0"
-    astral-regex "^1.0.0"
-    is-fullwidth-code-point "^2.0.0"
-
-source-map-support@^0.5.13:
-  version "0.5.13"
-  resolved "https://registry.yarnpkg.com/source-map-support/-/source-map-support-0.5.13.tgz#31b24a9c2e73c2de85066c0feb7d44767ed52932"
-  integrity sha512-SHSKFHadjVA5oR4PPqhtAVdcBWwRYVd6g6cAXnIbRiIwc2EhPrTuKUBdSLvlEKyIP3GCf89fltvcZiP9MMFA1w==
-  dependencies:
-    buffer-from "^1.0.0"
-    source-map "^0.6.0"
-
-source-map@^0.5.0:
-  version "0.5.7"
-  resolved "https://registry.yarnpkg.com/source-map/-/source-map-0.5.7.tgz#8a039d2d1021d22d1ea14c80d8ea468ba2ef3fcc"
-  integrity sha1-igOdLRAh0i0eoUyA2OpGi6LvP8w=
-
-source-map@^0.6.0:
-  version "0.6.1"
-  resolved "https://registry.yarnpkg.com/source-map/-/source-map-0.6.1.tgz#74722af32e9614e9c287a8d0bbde48b5e2f1a263"
-  integrity sha512-UjgapumWlbMhkBgzT7Ykc5YXUT46F0iKu8SGXq0bcwP5dz/h0Plj6enJqjz1Zbq2l5WaqYnrVbwWOWMyF3F47g==
-
-spdx-correct@^3.0.0:
-  version "3.1.0"
-  resolved "https://registry.yarnpkg.com/spdx-correct/-/spdx-correct-3.1.0.tgz#fb83e504445268f154b074e218c87c003cd31df4"
-  integrity sha512-lr2EZCctC2BNR7j7WzJ2FpDznxky1sjfxvvYEyzxNyb6lZXHODmEoJeFu4JupYlkfha1KZpJyoqiJ7pgA1qq8Q==
-  dependencies:
-    spdx-expression-parse "^3.0.0"
-    spdx-license-ids "^3.0.0"
-
-spdx-exceptions@^2.1.0:
-  version "2.2.0"
-  resolved "https://registry.yarnpkg.com/spdx-exceptions/-/spdx-exceptions-2.2.0.tgz#2ea450aee74f2a89bfb94519c07fcd6f41322977"
-  integrity sha512-2XQACfElKi9SlVb1CYadKDXvoajPgBVPn/gOQLrTvHdElaVhr7ZEbqJaRnJLVNeaI4cMEAgVCeBMKF6MWRDCRA==
-
-spdx-expression-parse@^3.0.0:
-  version "3.0.0"
-  resolved "https://registry.yarnpkg.com/spdx-expression-parse/-/spdx-expression-parse-3.0.0.tgz#99e119b7a5da00e05491c9fa338b7904823b41d0"
-  integrity sha512-Yg6D3XpRD4kkOmTpdgbUiEJFKghJH03fiC1OPll5h/0sO6neh2jqRDVHOQ4o/LMea0tgCkbMgea5ip/e+MkWyg==
-  dependencies:
-    spdx-exceptions "^2.1.0"
-    spdx-license-ids "^3.0.0"
-
-spdx-license-ids@^3.0.0:
-  version "3.0.5"
-  resolved "https://registry.yarnpkg.com/spdx-license-ids/-/spdx-license-ids-3.0.5.tgz#3694b5804567a458d3c8045842a6358632f62654"
-  integrity sha512-J+FWzZoynJEXGphVIS+XEh3kFSjZX/1i9gFBaWQcB+/tmpe2qUsSBABpcxqxnAxFdiUFEgAX1bjYGQvIZmoz9Q==
-
-sprintf-js@~1.0.2:
-  version "1.0.3"
-  resolved "https://registry.yarnpkg.com/sprintf-js/-/sprintf-js-1.0.3.tgz#04e6926f662895354f3dd015203633b857297e2c"
-  integrity sha1-BOaSb2YolTVPPdAVIDYzuFcpfiw=
-
-stack-utils@^1.0.2:
-  version "1.0.2"
-  resolved "https://registry.yarnpkg.com/stack-utils/-/stack-utils-1.0.2.tgz#33eba3897788558bebfc2db059dc158ec36cebb8"
-  integrity sha512-MTX+MeG5U994cazkjd/9KNAapsHnibjMLnfXodlkXw76JEea0UiNzrqidzo1emMwk7w5Qhc9jd4Bn9TBb1MFwA==
-
-string-width@^2.1.1:
-  version "2.1.1"
-  resolved "https://registry.yarnpkg.com/string-width/-/string-width-2.1.1.tgz#ab93f27a8dc13d28cac815c462143a6d9012ae9e"
-  integrity sha512-nOqH59deCq9SRHlxq1Aw85Jnt4w6KvLKqWVik6oA9ZklXLNIOlqg4F2yrT1MVaTjAqvVwdfeZ7w7aCvJD7ugkw==
-  dependencies:
-    is-fullwidth-code-point "^2.0.0"
-    strip-ansi "^4.0.0"
-
-string-width@^3.0.0:
-  version "3.1.0"
-  resolved "https://registry.yarnpkg.com/string-width/-/string-width-3.1.0.tgz#22767be21b62af1081574306f69ac51b62203961"
-  integrity sha512-vafcv6KjVZKSgz06oM/H6GDBrAtz8vdhQakGjFIvNrHA6y3HCF1CInLy+QLq8dTJPQ1b+KDUqDFctkdRW44e1w==
-  dependencies:
-    emoji-regex "^7.0.1"
-    is-fullwidth-code-point "^2.0.0"
-    strip-ansi "^5.1.0"
-
-string-width@^4.1.0:
-  version "4.1.0"
-  resolved "https://registry.yarnpkg.com/string-width/-/string-width-4.1.0.tgz#ba846d1daa97c3c596155308063e075ed1c99aff"
-  integrity sha512-NrX+1dVVh+6Y9dnQ19pR0pP4FiEIlUvdTGn8pw6CKTNq5sgib2nIhmUNT5TAmhWmvKr3WcxBcP3E8nWezuipuQ==
-  dependencies:
-    emoji-regex "^8.0.0"
-    is-fullwidth-code-point "^3.0.0"
-    strip-ansi "^5.2.0"
-
-strip-ansi@^4.0.0:
-  version "4.0.0"
-  resolved "https://registry.yarnpkg.com/strip-ansi/-/strip-ansi-4.0.0.tgz#a8479022eb1ac368a871389b635262c505ee368f"
-  integrity sha1-qEeQIusaw2iocTibY1JixQXuNo8=
-  dependencies:
-    ansi-regex "^3.0.0"
-
-strip-ansi@^5.1.0, strip-ansi@^5.2.0:
-  version "5.2.0"
-  resolved "https://registry.yarnpkg.com/strip-ansi/-/strip-ansi-5.2.0.tgz#8c9a536feb6afc962bdfa5b104a5091c1ad9c0ae"
-  integrity sha512-DuRs1gKbBqsMKIZlrffwlug8MHkcnpjs5VPmL1PAh+mA30U0DTotfDZ0d2UUsXpPmPmMMJ6W773MaA3J+lbiWA==
-  dependencies:
-    ansi-regex "^4.1.0"
-
-strip-bom-buf@^2.0.0:
-  version "2.0.0"
-  resolved "https://registry.yarnpkg.com/strip-bom-buf/-/strip-bom-buf-2.0.0.tgz#ff9c223937f8e7154b77e9de9bde094186885c15"
-  integrity sha512-gLFNHucd6gzb8jMsl5QmZ3QgnUJmp7qn4uUSHNwEXumAp7YizoGYw19ZUVfuq4aBOQUtyn2k8X/CwzWB73W2lQ==
-  dependencies:
-    is-utf8 "^0.2.1"
-
-strip-bom@^3.0.0:
-  version "3.0.0"
-  resolved "https://registry.yarnpkg.com/strip-bom/-/strip-bom-3.0.0.tgz#2334c18e9c759f7bdd56fdef7e9ae3d588e68ed3"
-  integrity sha1-IzTBjpx1n3vdVv3vfprj1YjmjtM=
-
-strip-eof@^1.0.0:
-  version "1.0.0"
-  resolved "https://registry.yarnpkg.com/strip-eof/-/strip-eof-1.0.0.tgz#bb43ff5598a6eb05d89b59fcd129c983313606bf"
-  integrity sha1-u0P/VZim6wXYm1n80SnJgzE2Br8=
-
-strip-indent@^2.0.0:
-  version "2.0.0"
-  resolved "https://registry.yarnpkg.com/strip-indent/-/strip-indent-2.0.0.tgz#5ef8db295d01e6ed6cbf7aab96998d7822527b68"
-  integrity sha1-XvjbKV0B5u1sv3qrlpmNeCJSe2g=
-
-strip-json-comments@~2.0.1:
-  version "2.0.1"
-  resolved "https://registry.yarnpkg.com/strip-json-comments/-/strip-json-comments-2.0.1.tgz#3c531942e908c2697c0ec344858c286c7ca0a60a"
-  integrity sha1-PFMZQukIwml8DsNEhYwobHygpgo=
-
-supertap@^1.0.0:
-  version "1.0.0"
-  resolved "https://registry.yarnpkg.com/supertap/-/supertap-1.0.0.tgz#bd9751c7fafd68c68cf8222a29892206a119fa9e"
-  integrity sha512-HZJ3geIMPgVwKk2VsmO5YHqnnJYl6bV5A9JW2uzqV43WmpgliNEYbuvukfor7URpaqpxuw3CfZ3ONdVbZjCgIA==
-  dependencies:
-    arrify "^1.0.1"
-    indent-string "^3.2.0"
-    js-yaml "^3.10.0"
-    serialize-error "^2.1.0"
-    strip-ansi "^4.0.0"
-
-supports-color@^5.3.0:
-  version "5.5.0"
-  resolved "https://registry.yarnpkg.com/supports-color/-/supports-color-5.5.0.tgz#e2e69a44ac8772f78a1ec0b35b689df6530efc8f"
-  integrity sha512-QjVjwdXIt408MIiAqCX4oUKsgU2EqAGzs2Ppkm4aQYbjm+ZEWEcW4SfFNTr4uMNZma0ey4f5lgLrkB0aX0QMow==
-  dependencies:
-    has-flag "^3.0.0"
-
-supports-color@^7.0.0:
-  version "7.0.0"
-  resolved "https://registry.yarnpkg.com/supports-color/-/supports-color-7.0.0.tgz#f2392c50ab35bb3cae7beebf24d254a19f880c06"
-  integrity sha512-WRt32iTpYEZWYOpcetGm0NPeSvaebccx7hhS/5M6sAiqnhedtFCHFxkjzZlJvFNCPowiKSFGiZk5USQDFy83vQ==
-  dependencies:
-    has-flag "^4.0.0"
-
-symbol-observable@^1.0.4:
-  version "1.2.0"
-  resolved "https://registry.yarnpkg.com/symbol-observable/-/symbol-observable-1.2.0.tgz#c22688aed4eab3cdc2dfeacbb561660560a00804"
-  integrity sha512-e900nM8RRtGhlV36KGEU9k65K3mPb1WV70OdjfxlG2EAuM1noi/E/BaW/uMhL7bPEssK8QV57vN3esixjUvcXQ==
-
-term-size@^1.2.0:
-  version "1.2.0"
-  resolved "https://registry.yarnpkg.com/term-size/-/term-size-1.2.0.tgz#458b83887f288fc56d6fffbfad262e26638efa69"
-  integrity sha1-RYuDiH8oj8Vtb/+/rSYuJmOO+mk=
-  dependencies:
-    execa "^0.7.0"
-
-time-zone@^1.0.0:
-  version "1.0.0"
-  resolved "https://registry.yarnpkg.com/time-zone/-/time-zone-1.0.0.tgz#99c5bf55958966af6d06d83bdf3800dc82faec5d"
-  integrity sha1-mcW/VZWJZq9tBtg73zgA3IL67F0=
-
-to-fast-properties@^2.0.0:
-  version "2.0.0"
-  resolved "https://registry.yarnpkg.com/to-fast-properties/-/to-fast-properties-2.0.0.tgz#dc5e698cbd079265bc73e0377681a4e4e83f616e"
-  integrity sha1-3F5pjL0HkmW8c+A3doGk5Og/YW4=
-
-to-readable-stream@^1.0.0:
-  version "1.0.0"
-  resolved "https://registry.yarnpkg.com/to-readable-stream/-/to-readable-stream-1.0.0.tgz#ce0aa0c2f3df6adf852efb404a783e77c0475771"
-  integrity sha512-Iq25XBt6zD5npPhlLVXGFN3/gyR2/qODcKNNyTMd4vbm39HUaOiAM4PMq0eMVC/Tkxz+Zjdsc55g9yyz+Yq00Q==
-
-to-regex-range@^5.0.1:
-  version "5.0.1"
-  resolved "https://registry.yarnpkg.com/to-regex-range/-/to-regex-range-5.0.1.tgz#1648c44aae7c8d988a326018ed72f5b4dd0392e4"
-  integrity sha512-65P7iz6X5yEr1cwcgvQxbbIw7Uk3gOy5dIdtZ4rDveLqhrdJP+Li/Hx6tyK0NEb+2GCyneCMJiGqrADCSNk8sQ==
-  dependencies:
-    is-number "^7.0.0"
-
-trim-newlines@^2.0.0:
-  version "2.0.0"
-  resolved "https://registry.yarnpkg.com/trim-newlines/-/trim-newlines-2.0.0.tgz#b403d0b91be50c331dfc4b82eeceb22c3de16d20"
-  integrity sha1-tAPQuRvlDDMd/EuC7s6yLD3hbSA=
-
-trim-off-newlines@^1.0.1:
-  version "1.0.1"
-  resolved "https://registry.yarnpkg.com/trim-off-newlines/-/trim-off-newlines-1.0.1.tgz#9f9ba9d9efa8764c387698bcbfeb2c848f11adb3"
-  integrity sha1-n5up2e+odkw4dpi8v+sshI8RrbM=
-
-trim-right@^1.0.1:
-  version "1.0.1"
-  resolved "https://registry.yarnpkg.com/trim-right/-/trim-right-1.0.1.tgz#cb2e1203067e0c8de1f614094b9fe45704ea6003"
-  integrity sha1-yy4SAwZ+DI3h9hQJS5/kVwTqYAM=
-
-type-fest@^0.3.0:
-  version "0.3.1"
-  resolved "https://registry.yarnpkg.com/type-fest/-/type-fest-0.3.1.tgz#63d00d204e059474fe5e1b7c011112bbd1dc29e1"
-  integrity sha512-cUGJnCdr4STbePCgqNFbpVNCepa+kAVohJs1sLhxzdH+gnEoOd8VhbYa7pD3zZYGiURWM2xzEII3fQcRizDkYQ==
-
-type-fest@^0.5.2:
-  version "0.5.2"
-  resolved "https://registry.yarnpkg.com/type-fest/-/type-fest-0.5.2.tgz#d6ef42a0356c6cd45f49485c3b6281fc148e48a2"
-  integrity sha512-DWkS49EQKVX//Tbupb9TFa19c7+MK1XmzkrZUR8TAktmE/DizXoaoJV6TZ/tSIPXipqNiRI6CyAe7x69Jb6RSw==
-
-typedarray-to-buffer@^3.1.5:
-  version "3.1.5"
-  resolved "https://registry.yarnpkg.com/typedarray-to-buffer/-/typedarray-to-buffer-3.1.5.tgz#a97ee7a9ff42691b9f783ff1bc5112fe3fca9080"
-  integrity sha512-zdu8XMNEDepKKR+XYOXAVPtWui0ly0NtohUscw+UmaHiAWT8hrV1rr//H6V+0DvJ3OQ19S979M0laLfX8rm82Q==
-  dependencies:
-    is-typedarray "^1.0.0"
-
-typescript@^3.7.0:
-  version "3.7.2"
-  resolved "https://registry.yarnpkg.com/typescript/-/typescript-3.7.2.tgz#27e489b95fa5909445e9fef5ee48d81697ad18fb"
-  integrity sha512-ml7V7JfiN2Xwvcer+XAf2csGO1bPBdRbFCkYBczNZggrBZ9c7G3riSUeJmqEU5uOtXNPMhE3n+R4FA/3YOAWOQ==
-
-uid2@0.0.3:
-  version "0.0.3"
-  resolved "https://registry.yarnpkg.com/uid2/-/uid2-0.0.3.tgz#483126e11774df2f71b8b639dcd799c376162b82"
-  integrity sha1-SDEm4Rd03y9xuLY53NeZw3YWK4I=
-
-unicode-canonical-property-names-ecmascript@^1.0.4:
-  version "1.0.4"
-  resolved "https://registry.yarnpkg.com/unicode-canonical-property-names-ecmascript/-/unicode-canonical-property-names-ecmascript-1.0.4.tgz#2619800c4c825800efdd8343af7dd9933cbe2818"
-  integrity sha512-jDrNnXWHd4oHiTZnx/ZG7gtUTVp+gCcTTKr8L0HjlwphROEW3+Him+IpvC+xcJEFegapiMZyZe02CyuOnRmbnQ==
-
-unicode-match-property-ecmascript@^1.0.4:
-  version "1.0.4"
-  resolved "https://registry.yarnpkg.com/unicode-match-property-ecmascript/-/unicode-match-property-ecmascript-1.0.4.tgz#8ed2a32569961bce9227d09cd3ffbb8fed5f020c"
-  integrity sha512-L4Qoh15vTfntsn4P1zqnHulG0LdXgjSO035fEpdtp6YxXhMT51Q6vgM5lYdG/5X3MjS+k/Y9Xw4SFCY9IkR0rg==
-  dependencies:
-    unicode-canonical-property-names-ecmascript "^1.0.4"
-    unicode-property-aliases-ecmascript "^1.0.4"
-
-unicode-match-property-value-ecmascript@^1.1.0:
-  version "1.1.0"
-  resolved "https://registry.yarnpkg.com/unicode-match-property-value-ecmascript/-/unicode-match-property-value-ecmascript-1.1.0.tgz#5b4b426e08d13a80365e0d657ac7a6c1ec46a277"
-  integrity sha512-hDTHvaBk3RmFzvSl0UVrUmC3PuW9wKVnpoUDYH0JDkSIovzw+J5viQmeYHxVSBptubnr7PbH2e0fnpDRQnQl5g==
-
-unicode-property-aliases-ecmascript@^1.0.4:
-  version "1.0.5"
-  resolved "https://registry.yarnpkg.com/unicode-property-aliases-ecmascript/-/unicode-property-aliases-ecmascript-1.0.5.tgz#a9cc6cc7ce63a0a3023fc99e341b94431d405a57"
-  integrity sha512-L5RAqCfXqAwR3RriF8pM0lU0w4Ryf/GgzONwi6KnL1taJQa7x1TCxdJnILX59WIGOwR57IVxn7Nej0fz1Ny6fw==
-
-unique-string@^1.0.0:
-  version "1.0.0"
-  resolved "https://registry.yarnpkg.com/unique-string/-/unique-string-1.0.0.tgz#9e1057cca851abb93398f8b33ae187b99caec11a"
-  integrity sha1-nhBXzKhRq7kzmPizOuGHuZyuwRo=
-  dependencies:
-    crypto-random-string "^1.0.0"
-
-unique-temp-dir@^1.0.0:
-  version "1.0.0"
-  resolved "https://registry.yarnpkg.com/unique-temp-dir/-/unique-temp-dir-1.0.0.tgz#6dce95b2681ca003eebfb304a415f9cbabcc5385"
-  integrity sha1-bc6VsmgcoAPuv7MEpBX5y6vMU4U=
-  dependencies:
-    mkdirp "^0.5.1"
-    os-tmpdir "^1.0.1"
-    uid2 "0.0.3"
-
-update-notifier@^3.0.1:
-  version "3.0.1"
-  resolved "https://registry.yarnpkg.com/update-notifier/-/update-notifier-3.0.1.tgz#78ecb68b915e2fd1be9f767f6e298ce87b736250"
-  integrity sha512-grrmrB6Zb8DUiyDIaeRTBCkgISYUgETNe7NglEbVsrLWXeESnlCSP50WfRSj/GmzMPl6Uchj24S/p80nP/ZQrQ==
-  dependencies:
-    boxen "^3.0.0"
-    chalk "^2.0.1"
-    configstore "^4.0.0"
-    has-yarn "^2.1.0"
-    import-lazy "^2.1.0"
-    is-ci "^2.0.0"
-    is-installed-globally "^0.1.0"
-    is-npm "^3.0.0"
-    is-yarn-global "^0.3.0"
-    latest-version "^5.0.0"
-    semver-diff "^2.0.0"
-    xdg-basedir "^3.0.0"
-
-url-parse-lax@^3.0.0:
-  version "3.0.0"
-  resolved "https://registry.yarnpkg.com/url-parse-lax/-/url-parse-lax-3.0.0.tgz#16b5cafc07dbe3676c1b1999177823d6503acb0c"
-  integrity sha1-FrXK/Afb42dsGxmZF3gj1lA6yww=
-  dependencies:
-    prepend-http "^2.0.0"
-
-validate-npm-package-license@^3.0.1:
-  version "3.0.4"
-  resolved "https://registry.yarnpkg.com/validate-npm-package-license/-/validate-npm-package-license-3.0.4.tgz#fc91f6b9c7ba15c857f4cb2c5defeec39d4f410a"
-  integrity sha512-DpKm2Ui/xN7/HQKCtpZxoRWBhZ9Z0kqtygG8XCgNQ8ZlDnxuQmWhj566j8fN4Cu3/JmbhsDo7fcAJq4s9h27Ew==
-  dependencies:
-    spdx-correct "^3.0.0"
-    spdx-expression-parse "^3.0.0"
-
-wcwidth@^1.0.1:
-  version "1.0.1"
-  resolved "https://registry.yarnpkg.com/wcwidth/-/wcwidth-1.0.1.tgz#f0b0dcf915bc5ff1528afadb2c0e17b532da2fe8"
-  integrity sha1-8LDc+RW8X/FSivrbLA4XtTLaL+g=
-  dependencies:
-    defaults "^1.0.3"
-
-well-known-symbols@^2.0.0:
-  version "2.0.0"
-  resolved "https://registry.yarnpkg.com/well-known-symbols/-/well-known-symbols-2.0.0.tgz#e9c7c07dbd132b7b84212c8174391ec1f9871ba5"
-  integrity sha512-ZMjC3ho+KXo0BfJb7JgtQ5IBuvnShdlACNkKkdsqBmYw3bPAaJfPeYUo6tLUaT5tG/Gkh7xkpBhKRQ9e7pyg9Q==
-
-which@^1.2.9:
-  version "1.3.1"
-  resolved "https://registry.yarnpkg.com/which/-/which-1.3.1.tgz#a45043d54f5805316da8d62f9f50918d3da70b0a"
-  integrity sha512-HxJdYWq1MTIQbJ3nw0cqssHoTNU267KlrDuGZ1WYlxDStUtKUhOaJmh112/TZmHxxUfuJqPXSOm7tDyas0OSIQ==
-  dependencies:
-    isexe "^2.0.0"
-
-widest-line@^2.0.0:
-  version "2.0.1"
-  resolved "https://registry.yarnpkg.com/widest-line/-/widest-line-2.0.1.tgz#7438764730ec7ef4381ce4df82fb98a53142a3fc"
-  integrity sha512-Ba5m9/Fa4Xt9eb2ELXt77JxVDV8w7qQrH0zS/TWSJdLyAwQjWoOzpzj5lwVftDz6n/EOu3tNACS84v509qwnJA==
-  dependencies:
-    string-width "^2.1.1"
-
-wrappy@1:
-  version "1.0.2"
-  resolved "https://registry.yarnpkg.com/wrappy/-/wrappy-1.0.2.tgz#b5243d8f3ec1aa35f1364605bc0d1036e30ab69f"
-  integrity sha1-tSQ9jz7BqjXxNkYFvA0QNuMKtp8=
-
-write-file-atomic@^2.0.0:
-  version "2.4.3"
-  resolved "https://registry.yarnpkg.com/write-file-atomic/-/write-file-atomic-2.4.3.tgz#1fd2e9ae1df3e75b8d8c367443c692d4ca81f481"
-  integrity sha512-GaETH5wwsX+GcnzhPgKcKjJ6M2Cq3/iZp1WyY/X1CSqrW+jVNM9Y7D8EC2sM4ZG/V8wZlSniJnCKWPmBYAucRQ==
-  dependencies:
-    graceful-fs "^4.1.11"
-    imurmurhash "^0.1.4"
-    signal-exit "^3.0.2"
-
-write-file-atomic@^3.0.0:
-  version "3.0.0"
-  resolved "https://registry.yarnpkg.com/write-file-atomic/-/write-file-atomic-3.0.0.tgz#1b64dbbf77cb58fd09056963d63e62667ab4fb21"
-  integrity sha512-EIgkf60l2oWsffja2Sf2AL384dx328c0B+cIYPTQq5q2rOYuDV00/iPFBOUiDKKwKMOhkymH8AidPaRvzfxY+Q==
-  dependencies:
-    imurmurhash "^0.1.4"
-    is-typedarray "^1.0.0"
-    signal-exit "^3.0.2"
-    typedarray-to-buffer "^3.1.5"
-
-xdg-basedir@^3.0.0:
-  version "3.0.0"
-  resolved "https://registry.yarnpkg.com/xdg-basedir/-/xdg-basedir-3.0.0.tgz#496b2cc109eca8dbacfe2dc72b603c17c5870ad4"
-  integrity sha1-SWsswQnsqNus/i3HK2A8F8WHCtQ=
-
-xtend@^4.0.0:
-  version "4.0.2"
-  resolved "https://registry.yarnpkg.com/xtend/-/xtend-4.0.2.tgz#bb72779f5fa465186b1f438f674fa347fdb5db54"
-  integrity sha512-LKYU1iAXJXUgAXn9URjiu+MWhyUXHsvfp7mcuYm9dSUKK0/CjtrUwFAxD82/mCWbtLsGjFIad0wIsod4zrTAEQ==
-
-yallist@^2.1.2:
-  version "2.1.2"
-  resolved "https://registry.yarnpkg.com/yallist/-/yallist-2.1.2.tgz#1c11f9218f076089a47dd512f93c6699a6a81d52"
-  integrity sha1-HBH5IY8HYImkfdUS+TxmmaaoHVI=
-
-yargs-parser@^10.0.0:
-  version "10.1.0"
-  resolved "https://registry.yarnpkg.com/yargs-parser/-/yargs-parser-10.1.0.tgz#7202265b89f7e9e9f2e5765e0fe735a905edbaa8"
-  integrity sha512-VCIyR1wJoEBZUqk5PA+oOBF6ypbwh5aNB3I50guxAL/quggdfs4TtNHQrSazFA3fYZ+tEqfs0zIGlv0c/rgjbQ==
-  dependencies:
-    camelcase "^4.1.0"