@slicemachine/manager 0.1.1-dev-plugins.3

package/dist/__node_modules/graphql/jsutils/isPromise.js

@@ -0,0 +1,7 @@
+function isPromise(value) {
+  return typeof (value === null || value === void 0 ? void 0 : value.then) === "function";
+}
+export {
+  isPromise
+};
+//# sourceMappingURL=isPromise.js.map

package/dist/__node_modules/graphql/jsutils/isPromise.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"isPromise.js","sources":["../../../../../../node_modules/graphql/jsutils/isPromise.mjs"],"sourcesContent":["/**\n * Returns true if the value acts like a Promise, i.e. has a \"then\" function,\n * otherwise returns false.\n */\nexport function isPromise(value) {\n  return (\n    typeof (value === null || value === void 0 ? void 0 : value.then) ===\n    'function'\n  );\n}\n"],"names":[],"mappings":"AAIO,SAAS,UAAU,OAAO;AAC/B,SACE,QAAQ,UAAU,QAAQ,UAAU,SAAS,SAAS,MAAM,UAC5D;AAEJ;"}

package/dist/__node_modules/graphql/jsutils/keyMap.cjs

@@ -0,0 +1,11 @@
+"use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+function keyMap(list, keyFn) {
+  const result = /* @__PURE__ */ Object.create(null);
+  for (const item of list) {
+    result[keyFn(item)] = item;
+  }
+  return result;
+}
+exports.keyMap = keyMap;
+//# sourceMappingURL=keyMap.cjs.map

package/dist/__node_modules/graphql/jsutils/keyMap.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"keyMap.cjs","sources":["../../../../../../node_modules/graphql/jsutils/keyMap.mjs"],"sourcesContent":["/**\n * Creates a keyed JS object from an array, given a function to produce the keys\n * for each value in the array.\n *\n * This provides a convenient lookup for the array items if the key function\n * produces unique results.\n * ```ts\n * const phoneBook = [\n *   { name: 'Jon', num: '555-1234' },\n *   { name: 'Jenny', num: '867-5309' }\n * ]\n *\n * const entriesByName = keyMap(\n *   phoneBook,\n *   entry => entry.name\n * )\n *\n * // {\n * //   Jon: { name: 'Jon', num: '555-1234' },\n * //   Jenny: { name: 'Jenny', num: '867-5309' }\n * // }\n *\n * const jennyEntry = entriesByName['Jenny']\n *\n * // { name: 'Jenny', num: '857-6309' }\n * ```\n */\nexport function keyMap(list, keyFn) {\n  const result = Object.create(null);\n\n  for (const item of list) {\n    result[keyFn(item)] = item;\n  }\n\n  return result;\n}\n"],"names":[],"mappings":";;AA2BO,SAAS,OAAO,MAAM,OAAO;AAClC,QAAM,SAAS,uBAAO,OAAO,IAAI;AAEjC,aAAW,QAAQ,MAAM;AACvB,WAAO,MAAM,IAAI,CAAC,IAAI;AAAA,EACvB;AAED,SAAO;AACT;;"}

package/dist/__node_modules/graphql/jsutils/keyMap.js

@@ -0,0 +1,11 @@
+function keyMap(list, keyFn) {
+  const result = /* @__PURE__ */ Object.create(null);
+  for (const item of list) {
+    result[keyFn(item)] = item;
+  }
+  return result;
+}
+export {
+  keyMap
+};
+//# sourceMappingURL=keyMap.js.map

package/dist/__node_modules/graphql/jsutils/keyMap.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"keyMap.js","sources":["../../../../../../node_modules/graphql/jsutils/keyMap.mjs"],"sourcesContent":["/**\n * Creates a keyed JS object from an array, given a function to produce the keys\n * for each value in the array.\n *\n * This provides a convenient lookup for the array items if the key function\n * produces unique results.\n * ```ts\n * const phoneBook = [\n *   { name: 'Jon', num: '555-1234' },\n *   { name: 'Jenny', num: '867-5309' }\n * ]\n *\n * const entriesByName = keyMap(\n *   phoneBook,\n *   entry => entry.name\n * )\n *\n * // {\n * //   Jon: { name: 'Jon', num: '555-1234' },\n * //   Jenny: { name: 'Jenny', num: '867-5309' }\n * // }\n *\n * const jennyEntry = entriesByName['Jenny']\n *\n * // { name: 'Jenny', num: '857-6309' }\n * ```\n */\nexport function keyMap(list, keyFn) {\n  const result = Object.create(null);\n\n  for (const item of list) {\n    result[keyFn(item)] = item;\n  }\n\n  return result;\n}\n"],"names":[],"mappings":"AA2BO,SAAS,OAAO,MAAM,OAAO;AAClC,QAAM,SAAS,uBAAO,OAAO,IAAI;AAEjC,aAAW,QAAQ,MAAM;AACvB,WAAO,MAAM,IAAI,CAAC,IAAI;AAAA,EACvB;AAED,SAAO;AACT;"}

package/dist/__node_modules/graphql/jsutils/keyValMap.cjs

@@ -0,0 +1,11 @@
+"use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+function keyValMap(list, keyFn, valFn) {
+  const result = /* @__PURE__ */ Object.create(null);
+  for (const item of list) {
+    result[keyFn(item)] = valFn(item);
+  }
+  return result;
+}
+exports.keyValMap = keyValMap;
+//# sourceMappingURL=keyValMap.cjs.map

package/dist/__node_modules/graphql/jsutils/keyValMap.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"keyValMap.cjs","sources":["../../../../../../node_modules/graphql/jsutils/keyValMap.mjs"],"sourcesContent":["/**\n * Creates a keyed JS object from an array, given a function to produce the keys\n * and a function to produce the values from each item in the array.\n * ```ts\n * const phoneBook = [\n *   { name: 'Jon', num: '555-1234' },\n *   { name: 'Jenny', num: '867-5309' }\n * ]\n *\n * // { Jon: '555-1234', Jenny: '867-5309' }\n * const phonesByName = keyValMap(\n *   phoneBook,\n *   entry => entry.name,\n *   entry => entry.num\n * )\n * ```\n */\nexport function keyValMap(list, keyFn, valFn) {\n  const result = Object.create(null);\n\n  for (const item of list) {\n    result[keyFn(item)] = valFn(item);\n  }\n\n  return result;\n}\n"],"names":[],"mappings":";;AAiBO,SAAS,UAAU,MAAM,OAAO,OAAO;AAC5C,QAAM,SAAS,uBAAO,OAAO,IAAI;AAEjC,aAAW,QAAQ,MAAM;AACvB,WAAO,MAAM,IAAI,CAAC,IAAI,MAAM,IAAI;AAAA,EACjC;AAED,SAAO;AACT;;"}

package/dist/__node_modules/graphql/jsutils/keyValMap.js

@@ -0,0 +1,11 @@
+function keyValMap(list, keyFn, valFn) {
+  const result = /* @__PURE__ */ Object.create(null);
+  for (const item of list) {
+    result[keyFn(item)] = valFn(item);
+  }
+  return result;
+}
+export {
+  keyValMap
+};
+//# sourceMappingURL=keyValMap.js.map

package/dist/__node_modules/graphql/jsutils/keyValMap.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"keyValMap.js","sources":["../../../../../../node_modules/graphql/jsutils/keyValMap.mjs"],"sourcesContent":["/**\n * Creates a keyed JS object from an array, given a function to produce the keys\n * and a function to produce the values from each item in the array.\n * ```ts\n * const phoneBook = [\n *   { name: 'Jon', num: '555-1234' },\n *   { name: 'Jenny', num: '867-5309' }\n * ]\n *\n * // { Jon: '555-1234', Jenny: '867-5309' }\n * const phonesByName = keyValMap(\n *   phoneBook,\n *   entry => entry.name,\n *   entry => entry.num\n * )\n * ```\n */\nexport function keyValMap(list, keyFn, valFn) {\n  const result = Object.create(null);\n\n  for (const item of list) {\n    result[keyFn(item)] = valFn(item);\n  }\n\n  return result;\n}\n"],"names":[],"mappings":"AAiBO,SAAS,UAAU,MAAM,OAAO,OAAO;AAC5C,QAAM,SAAS,uBAAO,OAAO,IAAI;AAEjC,aAAW,QAAQ,MAAM;AACvB,WAAO,MAAM,IAAI,CAAC,IAAI,MAAM,IAAI;AAAA,EACjC;AAED,SAAO;AACT;"}

package/dist/__node_modules/graphql/jsutils/mapValue.cjs

@@ -0,0 +1,11 @@
+"use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+function mapValue(map, fn) {
+  const result = /* @__PURE__ */ Object.create(null);
+  for (const key of Object.keys(map)) {
+    result[key] = fn(map[key], key);
+  }
+  return result;
+}
+exports.mapValue = mapValue;
+//# sourceMappingURL=mapValue.cjs.map

package/dist/__node_modules/graphql/jsutils/mapValue.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"mapValue.cjs","sources":["../../../../../../node_modules/graphql/jsutils/mapValue.mjs"],"sourcesContent":["/**\n * Creates an object map with the same keys as `map` and values generated by\n * running each value of `map` thru `fn`.\n */\nexport function mapValue(map, fn) {\n  const result = Object.create(null);\n\n  for (const key of Object.keys(map)) {\n    result[key] = fn(map[key], key);\n  }\n\n  return result;\n}\n"],"names":[],"mappings":";;AAIO,SAAS,SAAS,KAAK,IAAI;AAChC,QAAM,SAAS,uBAAO,OAAO,IAAI;AAEjC,aAAW,OAAO,OAAO,KAAK,GAAG,GAAG;AAClC,WAAO,GAAG,IAAI,GAAG,IAAI,GAAG,GAAG,GAAG;AAAA,EAC/B;AAED,SAAO;AACT;;"}

package/dist/__node_modules/graphql/jsutils/mapValue.js

@@ -0,0 +1,11 @@
+function mapValue(map, fn) {
+  const result = /* @__PURE__ */ Object.create(null);
+  for (const key of Object.keys(map)) {
+    result[key] = fn(map[key], key);
+  }
+  return result;
+}
+export {
+  mapValue
+};
+//# sourceMappingURL=mapValue.js.map

package/dist/__node_modules/graphql/jsutils/mapValue.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"mapValue.js","sources":["../../../../../../node_modules/graphql/jsutils/mapValue.mjs"],"sourcesContent":["/**\n * Creates an object map with the same keys as `map` and values generated by\n * running each value of `map` thru `fn`.\n */\nexport function mapValue(map, fn) {\n  const result = Object.create(null);\n\n  for (const key of Object.keys(map)) {\n    result[key] = fn(map[key], key);\n  }\n\n  return result;\n}\n"],"names":[],"mappings":"AAIO,SAAS,SAAS,KAAK,IAAI;AAChC,QAAM,SAAS,uBAAO,OAAO,IAAI;AAEjC,aAAW,OAAO,OAAO,KAAK,GAAG,GAAG;AAClC,WAAO,GAAG,IAAI,GAAG,IAAI,GAAG,GAAG,GAAG;AAAA,EAC/B;AAED,SAAO;AACT;"}

package/dist/__node_modules/graphql/jsutils/memoize3.cjs

@@ -0,0 +1,28 @@
+"use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+function memoize3(fn) {
+  let cache0;
+  return function memoized(a1, a2, a3) {
+    if (cache0 === void 0) {
+      cache0 = /* @__PURE__ */ new WeakMap();
+    }
+    let cache1 = cache0.get(a1);
+    if (cache1 === void 0) {
+      cache1 = /* @__PURE__ */ new WeakMap();
+      cache0.set(a1, cache1);
+    }
+    let cache2 = cache1.get(a2);
+    if (cache2 === void 0) {
+      cache2 = /* @__PURE__ */ new WeakMap();
+      cache1.set(a2, cache2);
+    }
+    let fnResult = cache2.get(a3);
+    if (fnResult === void 0) {
+      fnResult = fn(a1, a2, a3);
+      cache2.set(a3, fnResult);
+    }
+    return fnResult;
+  };
+}
+exports.memoize3 = memoize3;
+//# sourceMappingURL=memoize3.cjs.map

package/dist/__node_modules/graphql/jsutils/memoize3.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"memoize3.cjs","sources":["../../../../../../node_modules/graphql/jsutils/memoize3.mjs"],"sourcesContent":["/**\n * Memoizes the provided three-argument function.\n */\nexport function memoize3(fn) {\n  let cache0;\n  return function memoized(a1, a2, a3) {\n    if (cache0 === undefined) {\n      cache0 = new WeakMap();\n    }\n\n    let cache1 = cache0.get(a1);\n\n    if (cache1 === undefined) {\n      cache1 = new WeakMap();\n      cache0.set(a1, cache1);\n    }\n\n    let cache2 = cache1.get(a2);\n\n    if (cache2 === undefined) {\n      cache2 = new WeakMap();\n      cache1.set(a2, cache2);\n    }\n\n    let fnResult = cache2.get(a3);\n\n    if (fnResult === undefined) {\n      fnResult = fn(a1, a2, a3);\n      cache2.set(a3, fnResult);\n    }\n\n    return fnResult;\n  };\n}\n"],"names":[],"mappings":";;AAGO,SAAS,SAAS,IAAI;AAC3B,MAAI;AACJ,SAAO,SAAS,SAAS,IAAI,IAAI,IAAI;AACnC,QAAI,WAAW,QAAW;AACxB,eAAS,oBAAI;IACd;AAED,QAAI,SAAS,OAAO,IAAI,EAAE;AAE1B,QAAI,WAAW,QAAW;AACxB,eAAS,oBAAI;AACb,aAAO,IAAI,IAAI,MAAM;AAAA,IACtB;AAED,QAAI,SAAS,OAAO,IAAI,EAAE;AAE1B,QAAI,WAAW,QAAW;AACxB,eAAS,oBAAI;AACb,aAAO,IAAI,IAAI,MAAM;AAAA,IACtB;AAED,QAAI,WAAW,OAAO,IAAI,EAAE;AAE5B,QAAI,aAAa,QAAW;AAC1B,iBAAW,GAAG,IAAI,IAAI,EAAE;AACxB,aAAO,IAAI,IAAI,QAAQ;AAAA,IACxB;AAED,WAAO;AAAA,EACX;AACA;;"}

package/dist/__node_modules/graphql/jsutils/memoize3.js

@@ -0,0 +1,28 @@
+function memoize3(fn) {
+  let cache0;
+  return function memoized(a1, a2, a3) {
+    if (cache0 === void 0) {
+      cache0 = /* @__PURE__ */ new WeakMap();
+    }
+    let cache1 = cache0.get(a1);
+    if (cache1 === void 0) {
+      cache1 = /* @__PURE__ */ new WeakMap();
+      cache0.set(a1, cache1);
+    }
+    let cache2 = cache1.get(a2);
+    if (cache2 === void 0) {
+      cache2 = /* @__PURE__ */ new WeakMap();
+      cache1.set(a2, cache2);
+    }
+    let fnResult = cache2.get(a3);
+    if (fnResult === void 0) {
+      fnResult = fn(a1, a2, a3);
+      cache2.set(a3, fnResult);
+    }
+    return fnResult;
+  };
+}
+export {
+  memoize3
+};
+//# sourceMappingURL=memoize3.js.map

package/dist/__node_modules/graphql/jsutils/memoize3.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"memoize3.js","sources":["../../../../../../node_modules/graphql/jsutils/memoize3.mjs"],"sourcesContent":["/**\n * Memoizes the provided three-argument function.\n */\nexport function memoize3(fn) {\n  let cache0;\n  return function memoized(a1, a2, a3) {\n    if (cache0 === undefined) {\n      cache0 = new WeakMap();\n    }\n\n    let cache1 = cache0.get(a1);\n\n    if (cache1 === undefined) {\n      cache1 = new WeakMap();\n      cache0.set(a1, cache1);\n    }\n\n    let cache2 = cache1.get(a2);\n\n    if (cache2 === undefined) {\n      cache2 = new WeakMap();\n      cache1.set(a2, cache2);\n    }\n\n    let fnResult = cache2.get(a3);\n\n    if (fnResult === undefined) {\n      fnResult = fn(a1, a2, a3);\n      cache2.set(a3, fnResult);\n    }\n\n    return fnResult;\n  };\n}\n"],"names":[],"mappings":"AAGO,SAAS,SAAS,IAAI;AAC3B,MAAI;AACJ,SAAO,SAAS,SAAS,IAAI,IAAI,IAAI;AACnC,QAAI,WAAW,QAAW;AACxB,eAAS,oBAAI;IACd;AAED,QAAI,SAAS,OAAO,IAAI,EAAE;AAE1B,QAAI,WAAW,QAAW;AACxB,eAAS,oBAAI;AACb,aAAO,IAAI,IAAI,MAAM;AAAA,IACtB;AAED,QAAI,SAAS,OAAO,IAAI,EAAE;AAE1B,QAAI,WAAW,QAAW;AACxB,eAAS,oBAAI;AACb,aAAO,IAAI,IAAI,MAAM;AAAA,IACtB;AAED,QAAI,WAAW,OAAO,IAAI,EAAE;AAE5B,QAAI,aAAa,QAAW;AAC1B,iBAAW,GAAG,IAAI,IAAI,EAAE;AACxB,aAAO,IAAI,IAAI,QAAQ;AAAA,IACxB;AAED,WAAO;AAAA,EACX;AACA;"}

package/dist/__node_modules/graphql/jsutils/naturalCompare.cjs

@@ -0,0 +1,47 @@
+"use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+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;
+}
+exports.naturalCompare = naturalCompare;
+//# sourceMappingURL=naturalCompare.cjs.map

package/dist/__node_modules/graphql/jsutils/naturalCompare.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"naturalCompare.cjs","sources":["../../../../../../node_modules/graphql/jsutils/naturalCompare.mjs"],"sourcesContent":["/**\n * Returns a number indicating whether a reference string comes before, or after,\n * or is the same as the given string in natural sort order.\n *\n * See: https://en.wikipedia.org/wiki/Natural_sort_order\n *\n */\nexport function naturalCompare(aStr, bStr) {\n  let aIndex = 0;\n  let bIndex = 0;\n\n  while (aIndex < aStr.length && bIndex < bStr.length) {\n    let aChar = aStr.charCodeAt(aIndex);\n    let bChar = bStr.charCodeAt(bIndex);\n\n    if (isDigit(aChar) && isDigit(bChar)) {\n      let aNum = 0;\n\n      do {\n        ++aIndex;\n        aNum = aNum * 10 + aChar - DIGIT_0;\n        aChar = aStr.charCodeAt(aIndex);\n      } while (isDigit(aChar) && aNum > 0);\n\n      let bNum = 0;\n\n      do {\n        ++bIndex;\n        bNum = bNum * 10 + bChar - DIGIT_0;\n        bChar = bStr.charCodeAt(bIndex);\n      } while (isDigit(bChar) && bNum > 0);\n\n      if (aNum < bNum) {\n        return -1;\n      }\n\n      if (aNum > bNum) {\n        return 1;\n      }\n    } else {\n      if (aChar < bChar) {\n        return -1;\n      }\n\n      if (aChar > bChar) {\n        return 1;\n      }\n\n      ++aIndex;\n      ++bIndex;\n    }\n  }\n\n  return aStr.length - bStr.length;\n}\nconst DIGIT_0 = 48;\nconst DIGIT_9 = 57;\n\nfunction isDigit(code) {\n  return !isNaN(code) && DIGIT_0 <= code && code <= DIGIT_9;\n}\n"],"names":[],"mappings":";;AAOO,SAAS,eAAe,MAAM,MAAM;AACzC,MAAI,SAAS;AACb,MAAI,SAAS;AAEb,SAAO,SAAS,KAAK,UAAU,SAAS,KAAK,QAAQ;AACnD,QAAI,QAAQ,KAAK,WAAW,MAAM;AAClC,QAAI,QAAQ,KAAK,WAAW,MAAM;AAElC,QAAI,QAAQ,KAAK,KAAK,QAAQ,KAAK,GAAG;AACpC,UAAI,OAAO;AAEX,SAAG;AACD,UAAE;AACF,eAAO,OAAO,KAAK,QAAQ;AAC3B,gBAAQ,KAAK,WAAW,MAAM;AAAA,MAC/B,SAAQ,QAAQ,KAAK,KAAK,OAAO;AAElC,UAAI,OAAO;AAEX,SAAG;AACD,UAAE;AACF,eAAO,OAAO,KAAK,QAAQ;AAC3B,gBAAQ,KAAK,WAAW,MAAM;AAAA,MAC/B,SAAQ,QAAQ,KAAK,KAAK,OAAO;AAElC,UAAI,OAAO,MAAM;AACf,eAAO;AAAA,MACR;AAED,UAAI,OAAO,MAAM;AACf,eAAO;AAAA,MACR;AAAA,IACP,OAAW;AACL,UAAI,QAAQ,OAAO;AACjB,eAAO;AAAA,MACR;AAED,UAAI,QAAQ,OAAO;AACjB,eAAO;AAAA,MACR;AAED,QAAE;AACF,QAAE;AAAA,IACH;AAAA,EACF;AAED,SAAO,KAAK,SAAS,KAAK;AAC5B;AACA,MAAM,UAAU;AAChB,MAAM,UAAU;AAEhB,SAAS,QAAQ,MAAM;AACrB,SAAO,CAAC,MAAM,IAAI,KAAK,WAAW,QAAQ,QAAQ;AACpD;;"}

package/dist/__node_modules/graphql/jsutils/naturalCompare.js

@@ -0,0 +1,47 @@
+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
+};
+//# sourceMappingURL=naturalCompare.js.map

package/dist/__node_modules/graphql/jsutils/naturalCompare.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"naturalCompare.js","sources":["../../../../../../node_modules/graphql/jsutils/naturalCompare.mjs"],"sourcesContent":["/**\n * Returns a number indicating whether a reference string comes before, or after,\n * or is the same as the given string in natural sort order.\n *\n * See: https://en.wikipedia.org/wiki/Natural_sort_order\n *\n */\nexport function naturalCompare(aStr, bStr) {\n  let aIndex = 0;\n  let bIndex = 0;\n\n  while (aIndex < aStr.length && bIndex < bStr.length) {\n    let aChar = aStr.charCodeAt(aIndex);\n    let bChar = bStr.charCodeAt(bIndex);\n\n    if (isDigit(aChar) && isDigit(bChar)) {\n      let aNum = 0;\n\n      do {\n        ++aIndex;\n        aNum = aNum * 10 + aChar - DIGIT_0;\n        aChar = aStr.charCodeAt(aIndex);\n      } while (isDigit(aChar) && aNum > 0);\n\n      let bNum = 0;\n\n      do {\n        ++bIndex;\n        bNum = bNum * 10 + bChar - DIGIT_0;\n        bChar = bStr.charCodeAt(bIndex);\n      } while (isDigit(bChar) && bNum > 0);\n\n      if (aNum < bNum) {\n        return -1;\n      }\n\n      if (aNum > bNum) {\n        return 1;\n      }\n    } else {\n      if (aChar < bChar) {\n        return -1;\n      }\n\n      if (aChar > bChar) {\n        return 1;\n      }\n\n      ++aIndex;\n      ++bIndex;\n    }\n  }\n\n  return aStr.length - bStr.length;\n}\nconst DIGIT_0 = 48;\nconst DIGIT_9 = 57;\n\nfunction isDigit(code) {\n  return !isNaN(code) && DIGIT_0 <= code && code <= DIGIT_9;\n}\n"],"names":[],"mappings":"AAOO,SAAS,eAAe,MAAM,MAAM;AACzC,MAAI,SAAS;AACb,MAAI,SAAS;AAEb,SAAO,SAAS,KAAK,UAAU,SAAS,KAAK,QAAQ;AACnD,QAAI,QAAQ,KAAK,WAAW,MAAM;AAClC,QAAI,QAAQ,KAAK,WAAW,MAAM;AAElC,QAAI,QAAQ,KAAK,KAAK,QAAQ,KAAK,GAAG;AACpC,UAAI,OAAO;AAEX,SAAG;AACD,UAAE;AACF,eAAO,OAAO,KAAK,QAAQ;AAC3B,gBAAQ,KAAK,WAAW,MAAM;AAAA,MAC/B,SAAQ,QAAQ,KAAK,KAAK,OAAO;AAElC,UAAI,OAAO;AAEX,SAAG;AACD,UAAE;AACF,eAAO,OAAO,KAAK,QAAQ;AAC3B,gBAAQ,KAAK,WAAW,MAAM;AAAA,MAC/B,SAAQ,QAAQ,KAAK,KAAK,OAAO;AAElC,UAAI,OAAO,MAAM;AACf,eAAO;AAAA,MACR;AAED,UAAI,OAAO,MAAM;AACf,eAAO;AAAA,MACR;AAAA,IACP,OAAW;AACL,UAAI,QAAQ,OAAO;AACjB,eAAO;AAAA,MACR;AAED,UAAI,QAAQ,OAAO;AACjB,eAAO;AAAA,MACR;AAED,QAAE;AACF,QAAE;AAAA,IACH;AAAA,EACF;AAED,SAAO,KAAK,SAAS,KAAK;AAC5B;AACA,MAAM,UAAU;AAChB,MAAM,UAAU;AAEhB,SAAS,QAAQ,MAAM;AACrB,SAAO,CAAC,MAAM,IAAI,KAAK,WAAW,QAAQ,QAAQ;AACpD;"}

package/dist/__node_modules/graphql/jsutils/printPathArray.cjs

@@ -0,0 +1,9 @@
+"use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+function printPathArray(path) {
+  return path.map(
+    (key) => typeof key === "number" ? "[" + key.toString() + "]" : "." + key
+  ).join("");
+}
+exports.printPathArray = printPathArray;
+//# sourceMappingURL=printPathArray.cjs.map

package/dist/__node_modules/graphql/jsutils/printPathArray.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"printPathArray.cjs","sources":["../../../../../../node_modules/graphql/jsutils/printPathArray.mjs"],"sourcesContent":["/**\n * Build a string describing the path.\n */\nexport function printPathArray(path) {\n  return path\n    .map((key) =>\n      typeof key === 'number' ? '[' + key.toString() + ']' : '.' + key,\n    )\n    .join('');\n}\n"],"names":[],"mappings":";;AAGO,SAAS,eAAe,MAAM;AACnC,SAAO,KACJ;AAAA,IAAI,CAAC,QACJ,OAAO,QAAQ,WAAW,MAAM,IAAI,aAAa,MAAM,MAAM;AAAA,EAC9D,EACA,KAAK,EAAE;AACZ;;"}

package/dist/__node_modules/graphql/jsutils/printPathArray.js

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

package/dist/__node_modules/graphql/jsutils/printPathArray.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"printPathArray.js","sources":["../../../../../../node_modules/graphql/jsutils/printPathArray.mjs"],"sourcesContent":["/**\n * Build a string describing the path.\n */\nexport function printPathArray(path) {\n  return path\n    .map((key) =>\n      typeof key === 'number' ? '[' + key.toString() + ']' : '.' + key,\n    )\n    .join('');\n}\n"],"names":[],"mappings":"AAGO,SAAS,eAAe,MAAM;AACnC,SAAO,KACJ;AAAA,IAAI,CAAC,QACJ,OAAO,QAAQ,WAAW,MAAM,IAAI,aAAa,MAAM,MAAM;AAAA,EAC9D,EACA,KAAK,EAAE;AACZ;"}

package/dist/__node_modules/graphql/jsutils/promiseForObject.cjs

@@ -0,0 +1,13 @@
+"use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+function promiseForObject(object) {
+  return Promise.all(Object.values(object)).then((resolvedValues) => {
+    const resolvedObject = /* @__PURE__ */ Object.create(null);
+    for (const [i, key] of Object.keys(object).entries()) {
+      resolvedObject[key] = resolvedValues[i];
+    }
+    return resolvedObject;
+  });
+}
+exports.promiseForObject = promiseForObject;
+//# sourceMappingURL=promiseForObject.cjs.map

package/dist/__node_modules/graphql/jsutils/promiseForObject.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"promiseForObject.cjs","sources":["../../../../../../node_modules/graphql/jsutils/promiseForObject.mjs"],"sourcesContent":["/**\n * This function transforms a JS object `ObjMap<Promise<T>>` into\n * a `Promise<ObjMap<T>>`\n *\n * This is akin to bluebird's `Promise.props`, but implemented only using\n * `Promise.all` so it will work with any implementation of ES6 promises.\n */\nexport function promiseForObject(object) {\n  return Promise.all(Object.values(object)).then((resolvedValues) => {\n    const resolvedObject = Object.create(null);\n\n    for (const [i, key] of Object.keys(object).entries()) {\n      resolvedObject[key] = resolvedValues[i];\n    }\n\n    return resolvedObject;\n  });\n}\n"],"names":[],"mappings":";;AAOO,SAAS,iBAAiB,QAAQ;AACvC,SAAO,QAAQ,IAAI,OAAO,OAAO,MAAM,CAAC,EAAE,KAAK,CAAC,mBAAmB;AACjE,UAAM,iBAAiB,uBAAO,OAAO,IAAI;AAEzC,eAAW,CAAC,GAAG,GAAG,KAAK,OAAO,KAAK,MAAM,EAAE,WAAW;AACpD,qBAAe,GAAG,IAAI,eAAe,CAAC;AAAA,IACvC;AAED,WAAO;AAAA,EACX,CAAG;AACH;;"}

package/dist/__node_modules/graphql/jsutils/promiseForObject.js

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

package/dist/__node_modules/graphql/jsutils/promiseForObject.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"promiseForObject.js","sources":["../../../../../../node_modules/graphql/jsutils/promiseForObject.mjs"],"sourcesContent":["/**\n * This function transforms a JS object `ObjMap<Promise<T>>` into\n * a `Promise<ObjMap<T>>`\n *\n * This is akin to bluebird's `Promise.props`, but implemented only using\n * `Promise.all` so it will work with any implementation of ES6 promises.\n */\nexport function promiseForObject(object) {\n  return Promise.all(Object.values(object)).then((resolvedValues) => {\n    const resolvedObject = Object.create(null);\n\n    for (const [i, key] of Object.keys(object).entries()) {\n      resolvedObject[key] = resolvedValues[i];\n    }\n\n    return resolvedObject;\n  });\n}\n"],"names":[],"mappings":"AAOO,SAAS,iBAAiB,QAAQ;AACvC,SAAO,QAAQ,IAAI,OAAO,OAAO,MAAM,CAAC,EAAE,KAAK,CAAC,mBAAmB;AACjE,UAAM,iBAAiB,uBAAO,OAAO,IAAI;AAEzC,eAAW,CAAC,GAAG,GAAG,KAAK,OAAO,KAAK,MAAM,EAAE,WAAW;AACpD,qBAAe,GAAG,IAAI,eAAe,CAAC;AAAA,IACvC;AAED,WAAO;AAAA,EACX,CAAG;AACH;"}

package/dist/__node_modules/graphql/jsutils/promiseReduce.cjs

@@ -0,0 +1,12 @@
+"use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+const isPromise = require("./isPromise.cjs");
+function promiseReduce(values, callbackFn, initialValue) {
+  let accumulator = initialValue;
+  for (const value of values) {
+    accumulator = isPromise.isPromise(accumulator) ? accumulator.then((resolved) => callbackFn(resolved, value)) : callbackFn(accumulator, value);
+  }
+  return accumulator;
+}
+exports.promiseReduce = promiseReduce;
+//# sourceMappingURL=promiseReduce.cjs.map

package/dist/__node_modules/graphql/jsutils/promiseReduce.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"promiseReduce.cjs","sources":["../../../../../../node_modules/graphql/jsutils/promiseReduce.mjs"],"sourcesContent":["import { isPromise } from './isPromise.mjs';\n\n/**\n * Similar to Array.prototype.reduce(), however the reducing callback may return\n * a Promise, in which case reduction will continue after each promise resolves.\n *\n * If the callback does not return a Promise, then this function will also not\n * return a Promise.\n */\nexport function promiseReduce(values, callbackFn, initialValue) {\n  let accumulator = initialValue;\n\n  for (const value of values) {\n    accumulator = isPromise(accumulator)\n      ? accumulator.then((resolved) => callbackFn(resolved, value))\n      : callbackFn(accumulator, value);\n  }\n\n  return accumulator;\n}\n"],"names":["isPromise"],"mappings":";;;AASO,SAAS,cAAc,QAAQ,YAAY,cAAc;AAC9D,MAAI,cAAc;AAElB,aAAW,SAAS,QAAQ;AAC1B,kBAAcA,UAAS,UAAC,WAAW,IAC/B,YAAY,KAAK,CAAC,aAAa,WAAW,UAAU,KAAK,CAAC,IAC1D,WAAW,aAAa,KAAK;AAAA,EAClC;AAED,SAAO;AACT;;"}

package/dist/__node_modules/graphql/jsutils/promiseReduce.js

@@ -0,0 +1,12 @@
+import { isPromise } from "./isPromise.js";
+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
+};
+//# sourceMappingURL=promiseReduce.js.map

package/dist/__node_modules/graphql/jsutils/promiseReduce.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"promiseReduce.js","sources":["../../../../../../node_modules/graphql/jsutils/promiseReduce.mjs"],"sourcesContent":["import { isPromise } from './isPromise.mjs';\n\n/**\n * Similar to Array.prototype.reduce(), however the reducing callback may return\n * a Promise, in which case reduction will continue after each promise resolves.\n *\n * If the callback does not return a Promise, then this function will also not\n * return a Promise.\n */\nexport function promiseReduce(values, callbackFn, initialValue) {\n  let accumulator = initialValue;\n\n  for (const value of values) {\n    accumulator = isPromise(accumulator)\n      ? accumulator.then((resolved) => callbackFn(resolved, value))\n      : callbackFn(accumulator, value);\n  }\n\n  return accumulator;\n}\n"],"names":[],"mappings":";AASO,SAAS,cAAc,QAAQ,YAAY,cAAc;AAC9D,MAAI,cAAc;AAElB,aAAW,SAAS,QAAQ;AAC1B,kBAAc,UAAU,WAAW,IAC/B,YAAY,KAAK,CAAC,aAAa,WAAW,UAAU,KAAK,CAAC,IAC1D,WAAW,aAAa,KAAK;AAAA,EAClC;AAED,SAAO;AACT;"}

package/dist/__node_modules/graphql/jsutils/suggestionList.cjs

@@ -0,0 +1,94 @@
+"use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+const naturalCompare = require("./naturalCompare.cjs");
+function suggestionList(input, options) {
+  const optionsByDistance = /* @__PURE__ */ 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.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,
+          // delete
+          currentRow[j - 1] + 1,
+          // insert
+          upRow[j - 1] + cost
+          // substitute
+        );
+        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;
+}
+exports.suggestionList = suggestionList;
+//# sourceMappingURL=suggestionList.cjs.map

package/dist/__node_modules/graphql/jsutils/suggestionList.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"suggestionList.cjs","sources":["../../../../../../node_modules/graphql/jsutils/suggestionList.mjs"],"sourcesContent":["import { naturalCompare } from './naturalCompare.mjs';\n/**\n * Given an invalid input string and a list of valid options, returns a filtered\n * list of valid options sorted based on their similarity with the input.\n */\n\nexport function suggestionList(input, options) {\n  const optionsByDistance = Object.create(null);\n  const lexicalDistance = new LexicalDistance(input);\n  const threshold = Math.floor(input.length * 0.4) + 1;\n\n  for (const option of options) {\n    const distance = lexicalDistance.measure(option, threshold);\n\n    if (distance !== undefined) {\n      optionsByDistance[option] = distance;\n    }\n  }\n\n  return Object.keys(optionsByDistance).sort((a, b) => {\n    const distanceDiff = optionsByDistance[a] - optionsByDistance[b];\n    return distanceDiff !== 0 ? distanceDiff : naturalCompare(a, b);\n  });\n}\n/**\n * Computes the lexical distance between strings A and B.\n *\n * The \"distance\" between two strings is given by counting the minimum number\n * of edits needed to transform string A into string B. An edit can be an\n * insertion, deletion, or substitution of a single character, or a swap of two\n * adjacent characters.\n *\n * Includes a custom alteration from Damerau-Levenshtein to treat case changes\n * as a single edit which helps identify mis-cased values with an edit distance\n * of 1.\n *\n * This distance can be useful for detecting typos in input or sorting\n */\n\nclass LexicalDistance {\n  constructor(input) {\n    this._input = input;\n    this._inputLowerCase = input.toLowerCase();\n    this._inputArray = stringToArray(this._inputLowerCase);\n    this._rows = [\n      new Array(input.length + 1).fill(0),\n      new Array(input.length + 1).fill(0),\n      new Array(input.length + 1).fill(0),\n    ];\n  }\n\n  measure(option, threshold) {\n    if (this._input === option) {\n      return 0;\n    }\n\n    const optionLowerCase = option.toLowerCase(); // Any case change counts as a single edit\n\n    if (this._inputLowerCase === optionLowerCase) {\n      return 1;\n    }\n\n    let a = stringToArray(optionLowerCase);\n    let b = this._inputArray;\n\n    if (a.length < b.length) {\n      const tmp = a;\n      a = b;\n      b = tmp;\n    }\n\n    const aLength = a.length;\n    const bLength = b.length;\n\n    if (aLength - bLength > threshold) {\n      return undefined;\n    }\n\n    const rows = this._rows;\n\n    for (let j = 0; j <= bLength; j++) {\n      rows[0][j] = j;\n    }\n\n    for (let i = 1; i <= aLength; i++) {\n      const upRow = rows[(i - 1) % 3];\n      const currentRow = rows[i % 3];\n      let smallestCell = (currentRow[0] = i);\n\n      for (let j = 1; j <= bLength; j++) {\n        const cost = a[i - 1] === b[j - 1] ? 0 : 1;\n        let currentCell = Math.min(\n          upRow[j] + 1, // delete\n          currentRow[j - 1] + 1, // insert\n          upRow[j - 1] + cost, // substitute\n        );\n\n        if (i > 1 && j > 1 && a[i - 1] === b[j - 2] && a[i - 2] === b[j - 1]) {\n          // transposition\n          const doubleDiagonalCell = rows[(i - 2) % 3][j - 2];\n          currentCell = Math.min(currentCell, doubleDiagonalCell + 1);\n        }\n\n        if (currentCell < smallestCell) {\n          smallestCell = currentCell;\n        }\n\n        currentRow[j] = currentCell;\n      } // Early exit, since distance can't go smaller than smallest element of the previous row.\n\n      if (smallestCell > threshold) {\n        return undefined;\n      }\n    }\n\n    const distance = rows[aLength % 3][bLength];\n    return distance <= threshold ? distance : undefined;\n  }\n}\n\nfunction stringToArray(str) {\n  const strLength = str.length;\n  const array = new Array(strLength);\n\n  for (let i = 0; i < strLength; ++i) {\n    array[i] = str.charCodeAt(i);\n  }\n\n  return array;\n}\n"],"names":["naturalCompare"],"mappings":";;;AAMO,SAAS,eAAe,OAAO,SAAS;AAC7C,QAAM,oBAAoB,uBAAO,OAAO,IAAI;AAC5C,QAAM,kBAAkB,IAAI,gBAAgB,KAAK;AACjD,QAAM,YAAY,KAAK,MAAM,MAAM,SAAS,GAAG,IAAI;AAEnD,aAAW,UAAU,SAAS;AAC5B,UAAM,WAAW,gBAAgB,QAAQ,QAAQ,SAAS;AAE1D,QAAI,aAAa,QAAW;AAC1B,wBAAkB,MAAM,IAAI;AAAA,IAC7B;AAAA,EACF;AAED,SAAO,OAAO,KAAK,iBAAiB,EAAE,KAAK,CAAC,GAAG,MAAM;AACnD,UAAM,eAAe,kBAAkB,CAAC,IAAI,kBAAkB,CAAC;AAC/D,WAAO,iBAAiB,IAAI,eAAeA,eAAAA,eAAe,GAAG,CAAC;AAAA,EAClE,CAAG;AACH;AAgBA,MAAM,gBAAgB;AAAA,EACpB,YAAY,OAAO;AACjB,SAAK,SAAS;AACd,SAAK,kBAAkB,MAAM;AAC7B,SAAK,cAAc,cAAc,KAAK,eAAe;AACrD,SAAK,QAAQ;AAAA,MACX,IAAI,MAAM,MAAM,SAAS,CAAC,EAAE,KAAK,CAAC;AAAA,MAClC,IAAI,MAAM,MAAM,SAAS,CAAC,EAAE,KAAK,CAAC;AAAA,MAClC,IAAI,MAAM,MAAM,SAAS,CAAC,EAAE,KAAK,CAAC;AAAA,IACxC;AAAA,EACG;AAAA,EAED,QAAQ,QAAQ,WAAW;AACzB,QAAI,KAAK,WAAW,QAAQ;AAC1B,aAAO;AAAA,IACR;AAED,UAAM,kBAAkB,OAAO;AAE/B,QAAI,KAAK,oBAAoB,iBAAiB;AAC5C,aAAO;AAAA,IACR;AAED,QAAI,IAAI,cAAc,eAAe;AACrC,QAAI,IAAI,KAAK;AAEb,QAAI,EAAE,SAAS,EAAE,QAAQ;AACvB,YAAM,MAAM;AACZ,UAAI;AACJ,UAAI;AAAA,IACL;AAED,UAAM,UAAU,EAAE;AAClB,UAAM,UAAU,EAAE;AAElB,QAAI,UAAU,UAAU,WAAW;AACjC,aAAO;AAAA,IACR;AAED,UAAM,OAAO,KAAK;AAElB,aAAS,IAAI,GAAG,KAAK,SAAS,KAAK;AACjC,WAAK,CAAC,EAAE,CAAC,IAAI;AAAA,IACd;AAED,aAAS,IAAI,GAAG,KAAK,SAAS,KAAK;AACjC,YAAM,QAAQ,MAAM,IAAI,KAAK,CAAC;AAC9B,YAAM,aAAa,KAAK,IAAI,CAAC;AAC7B,UAAI,eAAgB,WAAW,CAAC,IAAI;AAEpC,eAAS,IAAI,GAAG,KAAK,SAAS,KAAK;AACjC,cAAM,OAAO,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,IAAI;AACzC,YAAI,cAAc,KAAK;AAAA,UACrB,MAAM,CAAC,IAAI;AAAA;AAAA,UACX,WAAW,IAAI,CAAC,IAAI;AAAA;AAAA,UACpB,MAAM,IAAI,CAAC,IAAI;AAAA;AAAA,QACzB;AAEQ,YAAI,IAAI,KAAK,IAAI,KAAK,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,GAAG;AAEpE,gBAAM,qBAAqB,MAAM,IAAI,KAAK,CAAC,EAAE,IAAI,CAAC;AAClD,wBAAc,KAAK,IAAI,aAAa,qBAAqB,CAAC;AAAA,QAC3D;AAED,YAAI,cAAc,cAAc;AAC9B,yBAAe;AAAA,QAChB;AAED,mBAAW,CAAC,IAAI;AAAA,MACjB;AAED,UAAI,eAAe,WAAW;AAC5B,eAAO;AAAA,MACR;AAAA,IACF;AAED,UAAM,WAAW,KAAK,UAAU,CAAC,EAAE,OAAO;AAC1C,WAAO,YAAY,YAAY,WAAW;AAAA,EAC3C;AACH;AAEA,SAAS,cAAc,KAAK;AAC1B,QAAM,YAAY,IAAI;AACtB,QAAM,QAAQ,IAAI,MAAM,SAAS;AAEjC,WAAS,IAAI,GAAG,IAAI,WAAW,EAAE,GAAG;AAClC,UAAM,CAAC,IAAI,IAAI,WAAW,CAAC;AAAA,EAC5B;AAED,SAAO;AACT;;"}

package/dist/__node_modules/graphql/jsutils/suggestionList.js

@@ -0,0 +1,94 @@
+import { naturalCompare } from "./naturalCompare.js";
+function suggestionList(input, options) {
+  const optionsByDistance = /* @__PURE__ */ 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,
+          // delete
+          currentRow[j - 1] + 1,
+          // insert
+          upRow[j - 1] + cost
+          // substitute
+        );
+        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
+};
+//# sourceMappingURL=suggestionList.js.map

package/dist/__node_modules/graphql/jsutils/suggestionList.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"suggestionList.js","sources":["../../../../../../node_modules/graphql/jsutils/suggestionList.mjs"],"sourcesContent":["import { naturalCompare } from './naturalCompare.mjs';\n/**\n * Given an invalid input string and a list of valid options, returns a filtered\n * list of valid options sorted based on their similarity with the input.\n */\n\nexport function suggestionList(input, options) {\n  const optionsByDistance = Object.create(null);\n  const lexicalDistance = new LexicalDistance(input);\n  const threshold = Math.floor(input.length * 0.4) + 1;\n\n  for (const option of options) {\n    const distance = lexicalDistance.measure(option, threshold);\n\n    if (distance !== undefined) {\n      optionsByDistance[option] = distance;\n    }\n  }\n\n  return Object.keys(optionsByDistance).sort((a, b) => {\n    const distanceDiff = optionsByDistance[a] - optionsByDistance[b];\n    return distanceDiff !== 0 ? distanceDiff : naturalCompare(a, b);\n  });\n}\n/**\n * Computes the lexical distance between strings A and B.\n *\n * The \"distance\" between two strings is given by counting the minimum number\n * of edits needed to transform string A into string B. An edit can be an\n * insertion, deletion, or substitution of a single character, or a swap of two\n * adjacent characters.\n *\n * Includes a custom alteration from Damerau-Levenshtein to treat case changes\n * as a single edit which helps identify mis-cased values with an edit distance\n * of 1.\n *\n * This distance can be useful for detecting typos in input or sorting\n */\n\nclass LexicalDistance {\n  constructor(input) {\n    this._input = input;\n    this._inputLowerCase = input.toLowerCase();\n    this._inputArray = stringToArray(this._inputLowerCase);\n    this._rows = [\n      new Array(input.length + 1).fill(0),\n      new Array(input.length + 1).fill(0),\n      new Array(input.length + 1).fill(0),\n    ];\n  }\n\n  measure(option, threshold) {\n    if (this._input === option) {\n      return 0;\n    }\n\n    const optionLowerCase = option.toLowerCase(); // Any case change counts as a single edit\n\n    if (this._inputLowerCase === optionLowerCase) {\n      return 1;\n    }\n\n    let a = stringToArray(optionLowerCase);\n    let b = this._inputArray;\n\n    if (a.length < b.length) {\n      const tmp = a;\n      a = b;\n      b = tmp;\n    }\n\n    const aLength = a.length;\n    const bLength = b.length;\n\n    if (aLength - bLength > threshold) {\n      return undefined;\n    }\n\n    const rows = this._rows;\n\n    for (let j = 0; j <= bLength; j++) {\n      rows[0][j] = j;\n    }\n\n    for (let i = 1; i <= aLength; i++) {\n      const upRow = rows[(i - 1) % 3];\n      const currentRow = rows[i % 3];\n      let smallestCell = (currentRow[0] = i);\n\n      for (let j = 1; j <= bLength; j++) {\n        const cost = a[i - 1] === b[j - 1] ? 0 : 1;\n        let currentCell = Math.min(\n          upRow[j] + 1, // delete\n          currentRow[j - 1] + 1, // insert\n          upRow[j - 1] + cost, // substitute\n        );\n\n        if (i > 1 && j > 1 && a[i - 1] === b[j - 2] && a[i - 2] === b[j - 1]) {\n          // transposition\n          const doubleDiagonalCell = rows[(i - 2) % 3][j - 2];\n          currentCell = Math.min(currentCell, doubleDiagonalCell + 1);\n        }\n\n        if (currentCell < smallestCell) {\n          smallestCell = currentCell;\n        }\n\n        currentRow[j] = currentCell;\n      } // Early exit, since distance can't go smaller than smallest element of the previous row.\n\n      if (smallestCell > threshold) {\n        return undefined;\n      }\n    }\n\n    const distance = rows[aLength % 3][bLength];\n    return distance <= threshold ? distance : undefined;\n  }\n}\n\nfunction stringToArray(str) {\n  const strLength = str.length;\n  const array = new Array(strLength);\n\n  for (let i = 0; i < strLength; ++i) {\n    array[i] = str.charCodeAt(i);\n  }\n\n  return array;\n}\n"],"names":[],"mappings":";AAMO,SAAS,eAAe,OAAO,SAAS;AAC7C,QAAM,oBAAoB,uBAAO,OAAO,IAAI;AAC5C,QAAM,kBAAkB,IAAI,gBAAgB,KAAK;AACjD,QAAM,YAAY,KAAK,MAAM,MAAM,SAAS,GAAG,IAAI;AAEnD,aAAW,UAAU,SAAS;AAC5B,UAAM,WAAW,gBAAgB,QAAQ,QAAQ,SAAS;AAE1D,QAAI,aAAa,QAAW;AAC1B,wBAAkB,MAAM,IAAI;AAAA,IAC7B;AAAA,EACF;AAED,SAAO,OAAO,KAAK,iBAAiB,EAAE,KAAK,CAAC,GAAG,MAAM;AACnD,UAAM,eAAe,kBAAkB,CAAC,IAAI,kBAAkB,CAAC;AAC/D,WAAO,iBAAiB,IAAI,eAAe,eAAe,GAAG,CAAC;AAAA,EAClE,CAAG;AACH;AAgBA,MAAM,gBAAgB;AAAA,EACpB,YAAY,OAAO;AACjB,SAAK,SAAS;AACd,SAAK,kBAAkB,MAAM;AAC7B,SAAK,cAAc,cAAc,KAAK,eAAe;AACrD,SAAK,QAAQ;AAAA,MACX,IAAI,MAAM,MAAM,SAAS,CAAC,EAAE,KAAK,CAAC;AAAA,MAClC,IAAI,MAAM,MAAM,SAAS,CAAC,EAAE,KAAK,CAAC;AAAA,MAClC,IAAI,MAAM,MAAM,SAAS,CAAC,EAAE,KAAK,CAAC;AAAA,IACxC;AAAA,EACG;AAAA,EAED,QAAQ,QAAQ,WAAW;AACzB,QAAI,KAAK,WAAW,QAAQ;AAC1B,aAAO;AAAA,IACR;AAED,UAAM,kBAAkB,OAAO;AAE/B,QAAI,KAAK,oBAAoB,iBAAiB;AAC5C,aAAO;AAAA,IACR;AAED,QAAI,IAAI,cAAc,eAAe;AACrC,QAAI,IAAI,KAAK;AAEb,QAAI,EAAE,SAAS,EAAE,QAAQ;AACvB,YAAM,MAAM;AACZ,UAAI;AACJ,UAAI;AAAA,IACL;AAED,UAAM,UAAU,EAAE;AAClB,UAAM,UAAU,EAAE;AAElB,QAAI,UAAU,UAAU,WAAW;AACjC,aAAO;AAAA,IACR;AAED,UAAM,OAAO,KAAK;AAElB,aAAS,IAAI,GAAG,KAAK,SAAS,KAAK;AACjC,WAAK,CAAC,EAAE,CAAC,IAAI;AAAA,IACd;AAED,aAAS,IAAI,GAAG,KAAK,SAAS,KAAK;AACjC,YAAM,QAAQ,MAAM,IAAI,KAAK,CAAC;AAC9B,YAAM,aAAa,KAAK,IAAI,CAAC;AAC7B,UAAI,eAAgB,WAAW,CAAC,IAAI;AAEpC,eAAS,IAAI,GAAG,KAAK,SAAS,KAAK;AACjC,cAAM,OAAO,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,IAAI;AACzC,YAAI,cAAc,KAAK;AAAA,UACrB,MAAM,CAAC,IAAI;AAAA;AAAA,UACX,WAAW,IAAI,CAAC,IAAI;AAAA;AAAA,UACpB,MAAM,IAAI,CAAC,IAAI;AAAA;AAAA,QACzB;AAEQ,YAAI,IAAI,KAAK,IAAI,KAAK,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,GAAG;AAEpE,gBAAM,qBAAqB,MAAM,IAAI,KAAK,CAAC,EAAE,IAAI,CAAC;AAClD,wBAAc,KAAK,IAAI,aAAa,qBAAqB,CAAC;AAAA,QAC3D;AAED,YAAI,cAAc,cAAc;AAC9B,yBAAe;AAAA,QAChB;AAED,mBAAW,CAAC,IAAI;AAAA,MACjB;AAED,UAAI,eAAe,WAAW;AAC5B,eAAO;AAAA,MACR;AAAA,IACF;AAED,UAAM,WAAW,KAAK,UAAU,CAAC,EAAE,OAAO;AAC1C,WAAO,YAAY,YAAY,WAAW;AAAA,EAC3C;AACH;AAEA,SAAS,cAAc,KAAK;AAC1B,QAAM,YAAY,IAAI;AACtB,QAAM,QAAQ,IAAI,MAAM,SAAS;AAEjC,WAAS,IAAI,GAAG,IAAI,WAAW,EAAE,GAAG;AAClC,UAAM,CAAC,IAAI,IAAI,WAAW,CAAC;AAAA,EAC5B;AAED,SAAO;AACT;"}