@graphitation/supermassive 0.1.3 → 0.2.0

package/lib/jsutils/naturalCompare.js

@@ -0,0 +1,53 @@
+var __defProp = Object.defineProperty;
+var __markAsModule = (target) => __defProp(target, "__esModule", {value: true});
+var __export = (target, all) => {
+  for (var name in all)
+    __defProp(target, name, {get: all[name], enumerable: true});
+};
+__markAsModule(exports);
+__export(exports, {
+  naturalCompare: () => naturalCompare
+});
+function naturalCompare(aStr, bStr) {
+  let aIndex = 0;
+  let bIndex = 0;
+  while (aIndex < aStr.length && bIndex < bStr.length) {
+    let aChar = aStr.charCodeAt(aIndex);
+    let bChar = bStr.charCodeAt(bIndex);
+    if (isDigit(aChar) && isDigit(bChar)) {
+      let aNum = 0;
+      do {
+        ++aIndex;
+        aNum = aNum * 10 + aChar - DIGIT_0;
+        aChar = aStr.charCodeAt(aIndex);
+      } while (isDigit(aChar) && aNum > 0);
+      let bNum = 0;
+      do {
+        ++bIndex;
+        bNum = bNum * 10 + bChar - DIGIT_0;
+        bChar = bStr.charCodeAt(bIndex);
+      } while (isDigit(bChar) && bNum > 0);
+      if (aNum < bNum) {
+        return -1;
+      }
+      if (aNum > bNum) {
+        return 1;
+      }
+    } else {
+      if (aChar < bChar) {
+        return -1;
+      }
+      if (aChar > bChar) {
+        return 1;
+      }
+      ++aIndex;
+      ++bIndex;
+    }
+  }
+  return aStr.length - bStr.length;
+}
+const DIGIT_0 = 48;
+const DIGIT_9 = 57;
+function isDigit(code) {
+  return !isNaN(code) && DIGIT_0 <= code && code <= DIGIT_9;
+}

package/lib/jsutils/naturalCompare.mjs

@@ -0,0 +1,46 @@
+function naturalCompare(aStr, bStr) {
+  let aIndex = 0;
+  let bIndex = 0;
+  while (aIndex < aStr.length && bIndex < bStr.length) {
+    let aChar = aStr.charCodeAt(aIndex);
+    let bChar = bStr.charCodeAt(bIndex);
+    if (isDigit(aChar) && isDigit(bChar)) {
+      let aNum = 0;
+      do {
+        ++aIndex;
+        aNum = aNum * 10 + aChar - DIGIT_0;
+        aChar = aStr.charCodeAt(aIndex);
+      } while (isDigit(aChar) && aNum > 0);
+      let bNum = 0;
+      do {
+        ++bIndex;
+        bNum = bNum * 10 + bChar - DIGIT_0;
+        bChar = bStr.charCodeAt(bIndex);
+      } while (isDigit(bChar) && bNum > 0);
+      if (aNum < bNum) {
+        return -1;
+      }
+      if (aNum > bNum) {
+        return 1;
+      }
+    } else {
+      if (aChar < bChar) {
+        return -1;
+      }
+      if (aChar > bChar) {
+        return 1;
+      }
+      ++aIndex;
+      ++bIndex;
+    }
+  }
+  return aStr.length - bStr.length;
+}
+const DIGIT_0 = 48;
+const DIGIT_9 = 57;
+function isDigit(code) {
+  return !isNaN(code) && DIGIT_0 <= code && code <= DIGIT_9;
+}
+export {
+  naturalCompare
+};

package/lib/jsutils/printPathArray.d.ts

@@ -0,0 +1,5 @@
+/**
+ * Build a string describing the path.
+ */
+export declare function printPathArray(path: ReadonlyArray<string | number>): string;
+//# sourceMappingURL=printPathArray.d.ts.map

package/lib/jsutils/printPathArray.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"printPathArray.d.ts","sourceRoot":"","sources":["../../src/jsutils/printPathArray.ts"],"names":[],"mappings":"AAAA;;GAEG;AACH,wBAAgB,cAAc,CAAC,IAAI,EAAE,aAAa,CAAC,MAAM,GAAG,MAAM,CAAC,GAAG,MAAM,CAM3E"}

package/lib/jsutils/printPathArray.js

@@ -0,0 +1,13 @@
+var __defProp = Object.defineProperty;
+var __markAsModule = (target) => __defProp(target, "__esModule", {value: true});
+var __export = (target, all) => {
+  for (var name in all)
+    __defProp(target, name, {get: all[name], enumerable: true});
+};
+__markAsModule(exports);
+__export(exports, {
+  printPathArray: () => printPathArray
+});
+function printPathArray(path) {
+  return path.map((key) => typeof key === "number" ? "[" + key.toString() + "]" : "." + key).join("");
+}

package/lib/jsutils/printPathArray.mjs

@@ -0,0 +1,6 @@
+function printPathArray(path) {
+  return path.map((key) => typeof key === "number" ? "[" + key.toString() + "]" : "." + key).join("");
+}
+export {
+  printPathArray
+};

package/lib/jsutils/promiseForObject.d.ts

@@ -0,0 +1,10 @@
+import type { ObjMap } from './ObjMap';
+/**
+ * This function transforms a JS object `ObjMap<Promise<T>>` into
+ * a `Promise<ObjMap<T>>`
+ *
+ * This is akin to bluebird's `Promise.props`, but implemented only using
+ * `Promise.all` so it will work with any implementation of ES6 promises.
+ */
+export declare function promiseForObject<T>(object: ObjMap<Promise<T>>): Promise<ObjMap<T>>;
+//# sourceMappingURL=promiseForObject.d.ts.map

package/lib/jsutils/promiseForObject.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"promiseForObject.d.ts","sourceRoot":"","sources":["../../src/jsutils/promiseForObject.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,UAAU,CAAC;AAEvC;;;;;;GAMG;AACH,wBAAgB,gBAAgB,CAAC,CAAC,EAChC,MAAM,EAAE,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,GACzB,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAQpB"}

package/lib/jsutils/promiseForObject.js

@@ -0,0 +1,19 @@
+var __defProp = Object.defineProperty;
+var __markAsModule = (target) => __defProp(target, "__esModule", {value: true});
+var __export = (target, all) => {
+  for (var name in all)
+    __defProp(target, name, {get: all[name], enumerable: true});
+};
+__markAsModule(exports);
+__export(exports, {
+  promiseForObject: () => promiseForObject
+});
+function promiseForObject(object) {
+  return Promise.all(Object.values(object)).then((resolvedValues) => {
+    const resolvedObject = Object.create(null);
+    for (const [i, key] of Object.keys(object).entries()) {
+      resolvedObject[key] = resolvedValues[i];
+    }
+    return resolvedObject;
+  });
+}

package/lib/jsutils/promiseForObject.mjs

@@ -0,0 +1,12 @@
+function promiseForObject(object) {
+  return Promise.all(Object.values(object)).then((resolvedValues) => {
+    const resolvedObject = Object.create(null);
+    for (const [i, key] of Object.keys(object).entries()) {
+      resolvedObject[key] = resolvedValues[i];
+    }
+    return resolvedObject;
+  });
+}
+export {
+  promiseForObject
+};

package/lib/jsutils/promiseReduce.d.ts

@@ -0,0 +1,10 @@
+import type { PromiseOrValue } from './PromiseOrValue';
+/**
+ * Similar to Array.prototype.reduce(), however the reducing callback may return
+ * a Promise, in which case reduction will continue after each promise resolves.
+ *
+ * If the callback does not return a Promise, then this function will also not
+ * return a Promise.
+ */
+export declare function promiseReduce<T, U>(values: Iterable<T>, callbackFn: (accumulator: U, currentValue: T) => PromiseOrValue<U>, initialValue: PromiseOrValue<U>): PromiseOrValue<U>;
+//# sourceMappingURL=promiseReduce.d.ts.map

package/lib/jsutils/promiseReduce.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"promiseReduce.d.ts","sourceRoot":"","sources":["../../src/jsutils/promiseReduce.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAIvD;;;;;;GAMG;AACH,wBAAgB,aAAa,CAAC,CAAC,EAAE,CAAC,EAChC,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,EACnB,UAAU,EAAE,CAAC,WAAW,EAAE,CAAC,EAAE,YAAY,EAAE,CAAC,KAAK,cAAc,CAAC,CAAC,CAAC,EAClE,YAAY,EAAE,cAAc,CAAC,CAAC,CAAC,GAC9B,cAAc,CAAC,CAAC,CAAC,CAQnB"}

package/lib/jsutils/promiseReduce.js

@@ -0,0 +1,34 @@
+var __create = Object.create;
+var __defProp = Object.defineProperty;
+var __getProtoOf = Object.getPrototypeOf;
+var __hasOwnProp = Object.prototype.hasOwnProperty;
+var __getOwnPropNames = Object.getOwnPropertyNames;
+var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
+var __markAsModule = (target) => __defProp(target, "__esModule", {value: true});
+var __export = (target, all) => {
+  for (var name in all)
+    __defProp(target, name, {get: all[name], enumerable: true});
+};
+var __reExport = (target, module2, desc) => {
+  if (module2 && typeof module2 === "object" || typeof module2 === "function") {
+    for (let key of __getOwnPropNames(module2))
+      if (!__hasOwnProp.call(target, key) && key !== "default")
+        __defProp(target, key, {get: () => module2[key], enumerable: !(desc = __getOwnPropDesc(module2, key)) || desc.enumerable});
+  }
+  return target;
+};
+var __toModule = (module2) => {
+  return __reExport(__markAsModule(__defProp(module2 != null ? __create(__getProtoOf(module2)) : {}, "default", module2 && module2.__esModule && "default" in module2 ? {get: () => module2.default, enumerable: true} : {value: module2, enumerable: true})), module2);
+};
+__markAsModule(exports);
+__export(exports, {
+  promiseReduce: () => promiseReduce
+});
+var import_isPromise = __toModule(require("./isPromise"));
+function promiseReduce(values, callbackFn, initialValue) {
+  let accumulator = initialValue;
+  for (const value of values) {
+    accumulator = (0, import_isPromise.isPromise)(accumulator) ? accumulator.then((resolved) => callbackFn(resolved, value)) : callbackFn(accumulator, value);
+  }
+  return accumulator;
+}

package/lib/jsutils/promiseReduce.mjs

@@ -0,0 +1,11 @@
+import {isPromise} from "./isPromise";
+function promiseReduce(values, callbackFn, initialValue) {
+  let accumulator = initialValue;
+  for (const value of values) {
+    accumulator = isPromise(accumulator) ? accumulator.then((resolved) => callbackFn(resolved, value)) : callbackFn(accumulator, value);
+  }
+  return accumulator;
+}
+export {
+  promiseReduce
+};

package/lib/jsutils/suggestionList.d.ts

@@ -0,0 +1,6 @@
+/**
+ * Given an invalid input string and a list of valid options, returns a filtered
+ * list of valid options sorted based on their similarity with the input.
+ */
+export declare function suggestionList(input: string, options: ReadonlyArray<string>): Array<string>;
+//# sourceMappingURL=suggestionList.d.ts.map

package/lib/jsutils/suggestionList.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"suggestionList.d.ts","sourceRoot":"","sources":["../../src/jsutils/suggestionList.ts"],"names":[],"mappings":"AAEA;;;GAGG;AACH,wBAAgB,cAAc,CAC5B,KAAK,EAAE,MAAM,EACb,OAAO,EAAE,aAAa,CAAC,MAAM,CAAC,GAC7B,KAAK,CAAC,MAAM,CAAC,CAgBf"}

package/lib/jsutils/suggestionList.js

@@ -0,0 +1,109 @@
+var __create = Object.create;
+var __defProp = Object.defineProperty;
+var __getProtoOf = Object.getPrototypeOf;
+var __hasOwnProp = Object.prototype.hasOwnProperty;
+var __getOwnPropNames = Object.getOwnPropertyNames;
+var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
+var __markAsModule = (target) => __defProp(target, "__esModule", {value: true});
+var __export = (target, all) => {
+  for (var name in all)
+    __defProp(target, name, {get: all[name], enumerable: true});
+};
+var __reExport = (target, module2, desc) => {
+  if (module2 && typeof module2 === "object" || typeof module2 === "function") {
+    for (let key of __getOwnPropNames(module2))
+      if (!__hasOwnProp.call(target, key) && key !== "default")
+        __defProp(target, key, {get: () => module2[key], enumerable: !(desc = __getOwnPropDesc(module2, key)) || desc.enumerable});
+  }
+  return target;
+};
+var __toModule = (module2) => {
+  return __reExport(__markAsModule(__defProp(module2 != null ? __create(__getProtoOf(module2)) : {}, "default", module2 && module2.__esModule && "default" in module2 ? {get: () => module2.default, enumerable: true} : {value: module2, enumerable: true})), module2);
+};
+__markAsModule(exports);
+__export(exports, {
+  suggestionList: () => suggestionList
+});
+var import_naturalCompare = __toModule(require("./naturalCompare"));
+function suggestionList(input, options) {
+  const optionsByDistance = Object.create(null);
+  const lexicalDistance = new LexicalDistance(input);
+  const threshold = Math.floor(input.length * 0.4) + 1;
+  for (const option of options) {
+    const distance = lexicalDistance.measure(option, threshold);
+    if (distance !== void 0) {
+      optionsByDistance[option] = distance;
+    }
+  }
+  return Object.keys(optionsByDistance).sort((a, b) => {
+    const distanceDiff = optionsByDistance[a] - optionsByDistance[b];
+    return distanceDiff !== 0 ? distanceDiff : (0, import_naturalCompare.naturalCompare)(a, b);
+  });
+}
+class LexicalDistance {
+  constructor(input) {
+    this._input = input;
+    this._inputLowerCase = input.toLowerCase();
+    this._inputArray = stringToArray(this._inputLowerCase);
+    this._rows = [
+      new Array(input.length + 1).fill(0),
+      new Array(input.length + 1).fill(0),
+      new Array(input.length + 1).fill(0)
+    ];
+  }
+  measure(option, threshold) {
+    if (this._input === option) {
+      return 0;
+    }
+    const optionLowerCase = option.toLowerCase();
+    if (this._inputLowerCase === optionLowerCase) {
+      return 1;
+    }
+    let a = stringToArray(optionLowerCase);
+    let b = this._inputArray;
+    if (a.length < b.length) {
+      const tmp = a;
+      a = b;
+      b = tmp;
+    }
+    const aLength = a.length;
+    const bLength = b.length;
+    if (aLength - bLength > threshold) {
+      return void 0;
+    }
+    const rows = this._rows;
+    for (let j = 0; j <= bLength; j++) {
+      rows[0][j] = j;
+    }
+    for (let i = 1; i <= aLength; i++) {
+      const upRow = rows[(i - 1) % 3];
+      const currentRow = rows[i % 3];
+      let smallestCell = currentRow[0] = i;
+      for (let j = 1; j <= bLength; j++) {
+        const cost = a[i - 1] === b[j - 1] ? 0 : 1;
+        let currentCell = Math.min(upRow[j] + 1, currentRow[j - 1] + 1, upRow[j - 1] + cost);
+        if (i > 1 && j > 1 && a[i - 1] === b[j - 2] && a[i - 2] === b[j - 1]) {
+          const doubleDiagonalCell = rows[(i - 2) % 3][j - 2];
+          currentCell = Math.min(currentCell, doubleDiagonalCell + 1);
+        }
+        if (currentCell < smallestCell) {
+          smallestCell = currentCell;
+        }
+        currentRow[j] = currentCell;
+      }
+      if (smallestCell > threshold) {
+        return void 0;
+      }
+    }
+    const distance = rows[aLength % 3][bLength];
+    return distance <= threshold ? distance : void 0;
+  }
+}
+function stringToArray(str) {
+  const strLength = str.length;
+  const array = new Array(strLength);
+  for (let i = 0; i < strLength; ++i) {
+    array[i] = str.charCodeAt(i);
+  }
+  return array;
+}

package/lib/jsutils/suggestionList.mjs

@@ -0,0 +1,86 @@
+import {naturalCompare} from "./naturalCompare";
+function suggestionList(input, options) {
+  const optionsByDistance = Object.create(null);
+  const lexicalDistance = new LexicalDistance(input);
+  const threshold = Math.floor(input.length * 0.4) + 1;
+  for (const option of options) {
+    const distance = lexicalDistance.measure(option, threshold);
+    if (distance !== void 0) {
+      optionsByDistance[option] = distance;
+    }
+  }
+  return Object.keys(optionsByDistance).sort((a, b) => {
+    const distanceDiff = optionsByDistance[a] - optionsByDistance[b];
+    return distanceDiff !== 0 ? distanceDiff : naturalCompare(a, b);
+  });
+}
+class LexicalDistance {
+  constructor(input) {
+    this._input = input;
+    this._inputLowerCase = input.toLowerCase();
+    this._inputArray = stringToArray(this._inputLowerCase);
+    this._rows = [
+      new Array(input.length + 1).fill(0),
+      new Array(input.length + 1).fill(0),
+      new Array(input.length + 1).fill(0)
+    ];
+  }
+  measure(option, threshold) {
+    if (this._input === option) {
+      return 0;
+    }
+    const optionLowerCase = option.toLowerCase();
+    if (this._inputLowerCase === optionLowerCase) {
+      return 1;
+    }
+    let a = stringToArray(optionLowerCase);
+    let b = this._inputArray;
+    if (a.length < b.length) {
+      const tmp = a;
+      a = b;
+      b = tmp;
+    }
+    const aLength = a.length;
+    const bLength = b.length;
+    if (aLength - bLength > threshold) {
+      return void 0;
+    }
+    const rows = this._rows;
+    for (let j = 0; j <= bLength; j++) {
+      rows[0][j] = j;
+    }
+    for (let i = 1; i <= aLength; i++) {
+      const upRow = rows[(i - 1) % 3];
+      const currentRow = rows[i % 3];
+      let smallestCell = currentRow[0] = i;
+      for (let j = 1; j <= bLength; j++) {
+        const cost = a[i - 1] === b[j - 1] ? 0 : 1;
+        let currentCell = Math.min(upRow[j] + 1, currentRow[j - 1] + 1, upRow[j - 1] + cost);
+        if (i > 1 && j > 1 && a[i - 1] === b[j - 2] && a[i - 2] === b[j - 1]) {
+          const doubleDiagonalCell = rows[(i - 2) % 3][j - 2];
+          currentCell = Math.min(currentCell, doubleDiagonalCell + 1);
+        }
+        if (currentCell < smallestCell) {
+          smallestCell = currentCell;
+        }
+        currentRow[j] = currentCell;
+      }
+      if (smallestCell > threshold) {
+        return void 0;
+      }
+    }
+    const distance = rows[aLength % 3][bLength];
+    return distance <= threshold ? distance : void 0;
+  }
+}
+function stringToArray(str) {
+  const strLength = str.length;
+  const array = new Array(strLength);
+  for (let i = 0; i < strLength; ++i) {
+    array[i] = str.charCodeAt(i);
+  }
+  return array;
+}
+export {
+  suggestionList
+};

package/lib/jsutils/toObjMap.d.ts

@@ -0,0 +1,4 @@
+import type { ObjMap, ObjMapLike, ReadOnlyObjMap, ReadOnlyObjMapLike } from './ObjMap';
+export declare function toObjMap<T>(obj: ObjMapLike<T>): ObjMap<T>;
+export declare function toObjMap<T>(obj: ReadOnlyObjMapLike<T>): ReadOnlyObjMap<T>;
+//# sourceMappingURL=toObjMap.d.ts.map

package/lib/jsutils/toObjMap.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"toObjMap.d.ts","sourceRoot":"","sources":["../../src/jsutils/toObjMap.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EACV,MAAM,EACN,UAAU,EACV,cAAc,EACd,kBAAkB,EACnB,MAAM,UAAU,CAAC;AAElB,wBAAgB,QAAQ,CAAC,CAAC,EAAE,GAAG,EAAE,UAAU,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;AAC3D,wBAAgB,QAAQ,CAAC,CAAC,EAAE,GAAG,EAAE,kBAAkB,CAAC,CAAC,CAAC,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC"}

package/lib/jsutils/toObjMap.js

@@ -0,0 +1,20 @@
+var __defProp = Object.defineProperty;
+var __markAsModule = (target) => __defProp(target, "__esModule", {value: true});
+var __export = (target, all) => {
+  for (var name in all)
+    __defProp(target, name, {get: all[name], enumerable: true});
+};
+__markAsModule(exports);
+__export(exports, {
+  toObjMap: () => toObjMap
+});
+function toObjMap(obj) {
+  if (Object.getPrototypeOf(obj) === null) {
+    return obj;
+  }
+  const map = Object.create(null);
+  for (const [key, value] of Object.entries(obj)) {
+    map[key] = value;
+  }
+  return map;
+}

package/lib/jsutils/toObjMap.mjs

@@ -0,0 +1,13 @@
+function toObjMap(obj) {
+  if (Object.getPrototypeOf(obj) === null) {
+    return obj;
+  }
+  const map = Object.create(null);
+  for (const [key, value] of Object.entries(obj)) {
+    map[key] = value;
+  }
+  return map;
+}
+export {
+  toObjMap
+};

package/lib/transforms/annotateDocumentGraphQLTransform.d.ts

@@ -0,0 +1,3 @@
+import { FragmentDefinitionNode, GraphQLSchema, OperationDefinitionNode } from "graphql";
+export declare const annotateDocumentGraphQLTransform: (schema: GraphQLSchema) => (node: FragmentDefinitionNode | OperationDefinitionNode) => import("../ast/TypedAST").DefinitionNode;
+//# sourceMappingURL=annotateDocumentGraphQLTransform.d.ts.map

package/lib/transforms/annotateDocumentGraphQLTransform.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"annotateDocumentGraphQLTransform.d.ts","sourceRoot":"","sources":["../../src/transforms/annotateDocumentGraphQLTransform.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,sBAAsB,EACtB,aAAa,EAEb,uBAAuB,EACxB,MAAM,SAAS,CAAC;AAGjB,eAAO,MAAM,gCAAgC,WAAY,aAAa,YACtD,sBAAsB,GAAG,uBAAuB,6CAO/D,CAAC"}

package/lib/transforms/annotateDocumentGraphQLTransform.js

@@ -0,0 +1,37 @@
+var __create = Object.create;
+var __defProp = Object.defineProperty;
+var __getProtoOf = Object.getPrototypeOf;
+var __hasOwnProp = Object.prototype.hasOwnProperty;
+var __getOwnPropNames = Object.getOwnPropertyNames;
+var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
+var __markAsModule = (target) => __defProp(target, "__esModule", {value: true});
+var __export = (target, all) => {
+  for (var name in all)
+    __defProp(target, name, {get: all[name], enumerable: true});
+};
+var __reExport = (target, module2, desc) => {
+  if (module2 && typeof module2 === "object" || typeof module2 === "function") {
+    for (let key of __getOwnPropNames(module2))
+      if (!__hasOwnProp.call(target, key) && key !== "default")
+        __defProp(target, key, {get: () => module2[key], enumerable: !(desc = __getOwnPropDesc(module2, key)) || desc.enumerable});
+  }
+  return target;
+};
+var __toModule = (module2) => {
+  return __reExport(__markAsModule(__defProp(module2 != null ? __create(__getProtoOf(module2)) : {}, "default", module2 && module2.__esModule && "default" in module2 ? {get: () => module2.default, enumerable: true} : {value: module2, enumerable: true})), module2);
+};
+__markAsModule(exports);
+__export(exports, {
+  annotateDocumentGraphQLTransform: () => annotateDocumentGraphQLTransform
+});
+var import_graphql = __toModule(require("graphql"));
+var import_addTypesToRequestDocument = __toModule(require("../ast/addTypesToRequestDocument"));
+const annotateDocumentGraphQLTransform = (schema) => {
+  return (node) => {
+    const document = (0, import_addTypesToRequestDocument.addTypesToRequestDocument)(schema, {
+      kind: import_graphql.Kind.DOCUMENT,
+      definitions: [node]
+    });
+    return document.definitions[0];
+  };
+};

package/lib/transforms/annotateDocumentGraphQLTransform.mjs

@@ -0,0 +1,16 @@
+import {
+  Kind
+} from "graphql";
+import {addTypesToRequestDocument} from "../ast/addTypesToRequestDocument";
+const annotateDocumentGraphQLTransform = (schema) => {
+  return (node) => {
+    const document = addTypesToRequestDocument(schema, {
+      kind: Kind.DOCUMENT,
+      definitions: [node]
+    });
+    return document.definitions[0];
+  };
+};
+export {
+  annotateDocumentGraphQLTransform
+};

package/lib/transforms/transformerTestUtils.d.ts

@@ -0,0 +1,79 @@
+import Ts from "typescript";
+import { Project } from "@ts-morph/bootstrap";
+export declare type TransformerFn = (program: Ts.Program) => Ts.TransformerFactory<Ts.SourceFile>;
+export declare class Transformer {
+    private compilerOptions;
+    private filePath?;
+    private file?;
+    private mocks;
+    private sources;
+    private transformers;
+    private project?;
+    private clone;
+    addMock(moduleDescriptor: ModuleDescriptor): Transformer;
+    addSource(source: File): Transformer;
+    addTransformer(transformer: TransformerFn): Transformer;
+    addTransformers(transformers: TransformerFn[]): Transformer;
+    setCompilerOptions(options: Ts.CompilerOptions): Transformer;
+    setFile(file: File): Transformer;
+    setFilePath(filePath: string): Transformer;
+    transform(input?: string): string;
+}
+/**
+ * @alpha
+ */
+export interface ModuleDescriptor {
+    name: string;
+    content: string;
+}
+/**
+ * @alpha
+ */
+export interface File {
+    path: string;
+    contents: string;
+}
+/**
+ * @alpha
+ */
+export interface TransformFileOptions {
+    project?: Project;
+    sources?: ReadonlyArray<File>;
+    mocks?: ReadonlyArray<ModuleDescriptor>;
+    compilerOptions?: Partial<Ts.CompilerOptions>;
+    transforms: ((program: Ts.Program) => Ts.TransformerFactory<Ts.SourceFile>)[];
+}
+/**
+ * Transform a TypeScript file given a project context and transform function
+ * in a virtual filesystem
+ *
+ * @example
+ * ```ts
+ * const file = {
+ *   path: '/index.ts',
+ *   contents: `
+ *     import { world } from "./world";
+ *     console.log("Hello,", world);
+ *   `
+ * };
+ *
+ * const sources = [
+ *  {
+ *    path: '/world.ts',
+ *    contents: `export const world = 'World'`
+ *  }
+ * ];
+ *
+ * transformFile(file, {
+ *   sources,
+ *   transform() { ... }
+ * })
+ * ```
+ *
+ * @alpha
+ * @param file - File to use as project root
+ * @param options - Options providing context to the transformation
+ */
+export declare const transformFile: (file: File, options: TransformFileOptions) => string;
+export declare function getCompilerOptions(options?: Partial<Ts.CompilerOptions>): Ts.CompilerOptions;
+//# sourceMappingURL=transformerTestUtils.d.ts.map

package/lib/transforms/transformerTestUtils.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"transformerTestUtils.d.ts","sourceRoot":"","sources":["../../src/transforms/transformerTestUtils.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,MAAM,YAAY,CAAC;AAE5B,OAAO,EAAqB,OAAO,EAAE,MAAM,qBAAqB,CAAC;AAEjE,oBAAY,aAAa,GAAG,CAC1B,OAAO,EAAE,EAAE,CAAC,OAAO,KAChB,EAAE,CAAC,kBAAkB,CAAC,EAAE,CAAC,UAAU,CAAC,CAAC;AAE1C,qBAAa,WAAW;IACtB,OAAO,CAAC,eAAe,CAA0B;IACjD,OAAO,CAAC,QAAQ,CAAC,CAAS;IAC1B,OAAO,CAAC,IAAI,CAAC,CAAO;IACpB,OAAO,CAAC,KAAK,CAA0B;IACvC,OAAO,CAAC,OAAO,CAAc;IAC7B,OAAO,CAAC,YAAY,CAAuB;IAC3C,OAAO,CAAC,OAAO,CAAC,CAAU;IAE1B,OAAO,CAAC,KAAK;IAYN,OAAO,CAAC,gBAAgB,EAAE,gBAAgB,GAAG,WAAW;IAMxD,SAAS,CAAC,MAAM,EAAE,IAAI,GAAG,WAAW;IAOpC,cAAc,CAAC,WAAW,EAAE,aAAa,GAAG,WAAW;IAOvD,eAAe,CAAC,YAAY,EAAE,aAAa,EAAE,GAAG,WAAW;IAO3D,kBAAkB,CAAC,OAAO,EAAE,EAAE,CAAC,eAAe,GAAG,WAAW;IAe5D,OAAO,CAAC,IAAI,EAAE,IAAI,GAAG,WAAW;IAOhC,WAAW,CAAC,QAAQ,EAAE,MAAM,GAAG,WAAW;IAO1C,SAAS,CAAC,KAAK,CAAC,EAAE,MAAM,GAAG,MAAM;CA8BzC;AAED;;GAEG;AACH,MAAM,WAAW,gBAAgB;IAC/B,IAAI,EAAE,MAAM,CAAC;IACb,OAAO,EAAE,MAAM,CAAC;CACjB;AAED;;GAEG;AACH,MAAM,WAAW,IAAI;IAEnB,IAAI,EAAE,MAAM,CAAC;IAEb,QAAQ,EAAE,MAAM,CAAC;CAClB;AAED;;GAEG;AACH,MAAM,WAAW,oBAAoB;IAEnC,OAAO,CAAC,EAAE,OAAO,CAAC;IAElB,OAAO,CAAC,EAAE,aAAa,CAAC,IAAI,CAAC,CAAC;IAE9B,KAAK,CAAC,EAAE,aAAa,CAAC,gBAAgB,CAAC,CAAC;IAExC,eAAe,CAAC,EAAE,OAAO,CAAC,EAAE,CAAC,eAAe,CAAC,CAAC;IAE9C,UAAU,EAAE,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,OAAO,KAAK,EAAE,CAAC,kBAAkB,CAAC,EAAE,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC;CAC/E;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA8BG;AACH,eAAO,MAAM,aAAa,SAClB,IAAI,WACD,oBAAoB,KAC5B,MAwDF,CAAC;AAEF,wBAAgB,kBAAkB,CAChC,OAAO,CAAC,EAAE,OAAO,CAAC,EAAE,CAAC,eAAe,CAAC,GACpC,EAAE,CAAC,eAAe,CAepB"}