@luvio/graphql-parser 0.75.1 → 0.77.1

package/dist/luvioGraphqlParser.js

@@ -3843,6 +3843,115 @@ function isTypeExtensionNode(node) {
   return node.kind === Kind.SCALAR_TYPE_EXTENSION || node.kind === Kind.OBJECT_TYPE_EXTENSION || node.kind === Kind.INTERFACE_TYPE_EXTENSION || node.kind === Kind.UNION_TYPE_EXTENSION || node.kind === Kind.ENUM_TYPE_EXTENSION || node.kind === Kind.INPUT_OBJECT_TYPE_EXTENSION;
 }
 
+/* eslint-disable no-redeclare */
+// $FlowFixMe[name-already-bound]
+var find = Array.prototype.find ? function (list, predicate) {
+  return Array.prototype.find.call(list, predicate);
+} : function (list, predicate) {
+  for (var _i2 = 0; _i2 < list.length; _i2++) {
+    var value = list[_i2];
+
+    if (predicate(value)) {
+      return value;
+    }
+  }
+};
+var find$1 = find;
+
+/* eslint-disable no-redeclare */
+// $FlowFixMe[name-already-bound]
+var arrayFrom = Array.from || function (obj, mapFn, thisArg) {
+  if (obj == null) {
+    throw new TypeError('Array.from requires an array-like object - not null or undefined');
+  } // Is Iterable?
+
+
+  var iteratorMethod = obj[SYMBOL_ITERATOR];
+
+  if (typeof iteratorMethod === 'function') {
+    var iterator = iteratorMethod.call(obj);
+    var result = [];
+    var step;
+
+    for (var i = 0; !(step = iterator.next()).done; ++i) {
+      result.push(mapFn.call(thisArg, step.value, i)); // Infinite Iterators could cause forEach to run forever.
+      // After a very large number of iterations, produce an error.
+      // istanbul ignore if (Too big to actually test)
+
+      if (i > 9999999) {
+        throw new TypeError('Near-infinite iteration.');
+      }
+    }
+
+    return result;
+  } // Is Array like?
+
+
+  var length = obj.length;
+
+  if (typeof length === 'number' && length >= 0 && length % 1 === 0) {
+    var _result = [];
+
+    for (var _i = 0; _i < length; ++_i) {
+      if (Object.prototype.hasOwnProperty.call(obj, _i)) {
+        _result.push(mapFn.call(thisArg, obj[_i], _i));
+      }
+    }
+
+    return _result;
+  }
+
+  return [];
+};
+
+var arrayFrom$1 = arrayFrom;
+
+/* eslint-disable no-redeclare */
+// $FlowFixMe[name-already-bound] workaround for: https://github.com/facebook/flow/issues/4441
+var objectValues = Object.values || function (obj) {
+  return Object.keys(obj).map(function (key) {
+    return obj[key];
+  });
+};
+
+var objectValues$1 = objectValues;
+
+/* eslint-disable no-redeclare */
+// $FlowFixMe[name-already-bound] workaround for: https://github.com/facebook/flow/issues/4441
+var objectEntries = Object.entries || function (obj) {
+  return Object.keys(obj).map(function (key) {
+    return [key, obj[key]];
+  });
+};
+
+var objectEntries$1 = objectEntries;
+
+function toObjMap(obj) {
+  /* eslint-enable no-redeclare */
+  if (Object.getPrototypeOf(obj) === null) {
+    return obj;
+  }
+
+  var map = Object.create(null);
+
+  for (var _i2 = 0, _objectEntries2 = objectEntries$1(obj); _i2 < _objectEntries2.length; _i2++) {
+    var _ref2 = _objectEntries2[_i2];
+    var key = _ref2[0];
+    var value = _ref2[1];
+    map[key] = value;
+  }
+
+  return map;
+}
+
+/* eslint-disable no-redeclare */
+// $FlowFixMe[name-already-bound] workaround for: https://github.com/facebook/flow/issues/4441
+var isFinitePolyfill = Number.isFinite || function (value) {
+  return typeof value === 'number' && isFinite(value);
+};
+
+var isFinite$1 = isFinitePolyfill;
+
 function _typeof(obj) { "@babel/helpers - typeof"; if (typeof Symbol === "function" && typeof Symbol.iterator === "symbol") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; } return _typeof(obj); }
 /**
  * Safer version of `Array.from` that return `null` if value isn't convertible to array.
@@ -3908,40 +4017,13 @@ function safeArrayFrom(collection) {
   return null;
 }
 
-/* eslint-disable no-redeclare */
-// $FlowFixMe[name-already-bound]
-var find = Array.prototype.find ? function (list, predicate) {
-  return Array.prototype.find.call(list, predicate);
-} : function (list, predicate) {
-  for (var _i2 = 0; _i2 < list.length; _i2++) {
-    var value = list[_i2];
-
-    if (predicate(value)) {
-      return value;
-    }
-  }
-};
-var find$1 = find;
-
-/* eslint-disable no-redeclare */
-// $FlowFixMe[name-already-bound] workaround for: https://github.com/facebook/flow/issues/4441
-var objectValues = Object.values || function (obj) {
-  return Object.keys(obj).map(function (key) {
-    return obj[key];
-  });
-};
-
-var objectValues$1 = objectValues;
-
 /* eslint-disable no-redeclare */
 // $FlowFixMe[name-already-bound] workaround for: https://github.com/facebook/flow/issues/4441
-var objectEntries = Object.entries || function (obj) {
-  return Object.keys(obj).map(function (key) {
-    return [key, obj[key]];
-  });
+var isInteger = Number.isInteger || function (value) {
+  return typeof value === 'number' && isFinite(value) && Math.floor(value) === value;
 };
 
-var objectEntries$1 = objectEntries;
+var isInteger$1 = isInteger;
 
 /**
  * Creates a keyed JS object from an array, given a function to produce the keys
@@ -3990,24 +4072,6 @@ function mapValue(map, fn) {
   return result;
 }
 
-function toObjMap(obj) {
-  /* eslint-enable no-redeclare */
-  if (Object.getPrototypeOf(obj) === null) {
-    return obj;
-  }
-
-  var map = Object.create(null);
-
-  for (var _i2 = 0, _objectEntries2 = objectEntries$1(obj); _i2 < _objectEntries2.length; _i2++) {
-    var _ref2 = _objectEntries2[_i2];
-    var key = _ref2[0];
-    var value = _ref2[1];
-    map[key] = value;
-  }
-
-  return map;
-}
-
 /**
  * Creates a keyed JS object from an array, given a function to produce the keys
  * and a function to produce the values from each item in the array.
@@ -5291,151 +5355,6 @@ function isRequiredInputField(field) {
   return isNonNullType(field.type) && field.defaultValue === undefined;
 }
 
-/**
- * Provided a type and a super type, return true if the first type is either
- * equal or a subset of the second super type (covariant).
- */
-
-function isTypeSubTypeOf(schema, maybeSubType, superType) {
-  // Equivalent type is a valid subtype
-  if (maybeSubType === superType) {
-    return true;
-  } // If superType is non-null, maybeSubType must also be non-null.
-
-
-  if (isNonNullType(superType)) {
-    if (isNonNullType(maybeSubType)) {
-      return isTypeSubTypeOf(schema, maybeSubType.ofType, superType.ofType);
-    }
-
-    return false;
-  }
-
-  if (isNonNullType(maybeSubType)) {
-    // If superType is nullable, maybeSubType may be non-null or nullable.
-    return isTypeSubTypeOf(schema, maybeSubType.ofType, superType);
-  } // If superType type is a list, maybeSubType type must also be a list.
-
-
-  if (isListType(superType)) {
-    if (isListType(maybeSubType)) {
-      return isTypeSubTypeOf(schema, maybeSubType.ofType, superType.ofType);
-    }
-
-    return false;
-  }
-
-  if (isListType(maybeSubType)) {
-    // If superType is not a list, maybeSubType must also be not a list.
-    return false;
-  } // If superType type is an abstract type, check if it is super type of maybeSubType.
-  // Otherwise, the child type is not a valid subtype of the parent type.
-
-
-  return isAbstractType(superType) && (isInterfaceType(maybeSubType) || isObjectType(maybeSubType)) && schema.isSubType(superType, maybeSubType);
-}
-/**
- * Provided two composite types, determine if they "overlap". Two composite
- * types overlap when the Sets of possible concrete types for each intersect.
- *
- * This is often used to determine if a fragment of a given type could possibly
- * be visited in a context of another type.
- *
- * This function is commutative.
- */
-
-function doTypesOverlap(schema, typeA, typeB) {
-  // Equivalent types overlap
-  if (typeA === typeB) {
-    return true;
-  }
-
-  if (isAbstractType(typeA)) {
-    if (isAbstractType(typeB)) {
-      // If both types are abstract, then determine if there is any intersection
-      // between possible concrete types of each.
-      return schema.getPossibleTypes(typeA).some(function (type) {
-        return schema.isSubType(typeB, type);
-      });
-    } // Determine if the latter type is a possible concrete type of the former.
-
-
-    return schema.isSubType(typeA, typeB);
-  }
-
-  if (isAbstractType(typeB)) {
-    // Determine if the former type is a possible concrete type of the latter.
-    return schema.isSubType(typeB, typeA);
-  } // Otherwise the types do not overlap.
-
-
-  return false;
-}
-
-/* eslint-disable no-redeclare */
-// $FlowFixMe[name-already-bound]
-var arrayFrom = Array.from || function (obj, mapFn, thisArg) {
-  if (obj == null) {
-    throw new TypeError('Array.from requires an array-like object - not null or undefined');
-  } // Is Iterable?
-
-
-  var iteratorMethod = obj[SYMBOL_ITERATOR];
-
-  if (typeof iteratorMethod === 'function') {
-    var iterator = iteratorMethod.call(obj);
-    var result = [];
-    var step;
-
-    for (var i = 0; !(step = iterator.next()).done; ++i) {
-      result.push(mapFn.call(thisArg, step.value, i)); // Infinite Iterators could cause forEach to run forever.
-      // After a very large number of iterations, produce an error.
-      // istanbul ignore if (Too big to actually test)
-
-      if (i > 9999999) {
-        throw new TypeError('Near-infinite iteration.');
-      }
-    }
-
-    return result;
-  } // Is Array like?
-
-
-  var length = obj.length;
-
-  if (typeof length === 'number' && length >= 0 && length % 1 === 0) {
-    var _result = [];
-
-    for (var _i = 0; _i < length; ++_i) {
-      if (Object.prototype.hasOwnProperty.call(obj, _i)) {
-        _result.push(mapFn.call(thisArg, obj[_i], _i));
-      }
-    }
-
-    return _result;
-  }
-
-  return [];
-};
-
-var arrayFrom$1 = arrayFrom;
-
-/* eslint-disable no-redeclare */
-// $FlowFixMe[name-already-bound] workaround for: https://github.com/facebook/flow/issues/4441
-var isFinitePolyfill = Number.isFinite || function (value) {
-  return typeof value === 'number' && isFinite(value);
-};
-
-var isFinite$1 = isFinitePolyfill;
-
-/* eslint-disable no-redeclare */
-// $FlowFixMe[name-already-bound] workaround for: https://github.com/facebook/flow/issues/4441
-var isInteger = Number.isInteger || function (value) {
-  return typeof value === 'number' && isFinite(value) && Math.floor(value) === value;
-};
-
-var isInteger$1 = isInteger;
-
 // 32-bit signed integer, providing the broadest support across platforms.
 //
 // n.b. JavaScript's integers are safe between -(2^53 - 1) and 2^53 - 1 because
@@ -6912,6 +6831,87 @@ function collectReferencedTypes(type, typeSet) {
   return typeSet;
 }
 
+/**
+ * Provided a type and a super type, return true if the first type is either
+ * equal or a subset of the second super type (covariant).
+ */
+
+function isTypeSubTypeOf(schema, maybeSubType, superType) {
+  // Equivalent type is a valid subtype
+  if (maybeSubType === superType) {
+    return true;
+  } // If superType is non-null, maybeSubType must also be non-null.
+
+
+  if (isNonNullType(superType)) {
+    if (isNonNullType(maybeSubType)) {
+      return isTypeSubTypeOf(schema, maybeSubType.ofType, superType.ofType);
+    }
+
+    return false;
+  }
+
+  if (isNonNullType(maybeSubType)) {
+    // If superType is nullable, maybeSubType may be non-null or nullable.
+    return isTypeSubTypeOf(schema, maybeSubType.ofType, superType);
+  } // If superType type is a list, maybeSubType type must also be a list.
+
+
+  if (isListType(superType)) {
+    if (isListType(maybeSubType)) {
+      return isTypeSubTypeOf(schema, maybeSubType.ofType, superType.ofType);
+    }
+
+    return false;
+  }
+
+  if (isListType(maybeSubType)) {
+    // If superType is not a list, maybeSubType must also be not a list.
+    return false;
+  } // If superType type is an abstract type, check if it is super type of maybeSubType.
+  // Otherwise, the child type is not a valid subtype of the parent type.
+
+
+  return isAbstractType(superType) && (isInterfaceType(maybeSubType) || isObjectType(maybeSubType)) && schema.isSubType(superType, maybeSubType);
+}
+/**
+ * Provided two composite types, determine if they "overlap". Two composite
+ * types overlap when the Sets of possible concrete types for each intersect.
+ *
+ * This is often used to determine if a fragment of a given type could possibly
+ * be visited in a context of another type.
+ *
+ * This function is commutative.
+ */
+
+function doTypesOverlap(schema, typeA, typeB) {
+  // Equivalent types overlap
+  if (typeA === typeB) {
+    return true;
+  }
+
+  if (isAbstractType(typeA)) {
+    if (isAbstractType(typeB)) {
+      // If both types are abstract, then determine if there is any intersection
+      // between possible concrete types of each.
+      return schema.getPossibleTypes(typeA).some(function (type) {
+        return schema.isSubType(typeB, type);
+      });
+    } // Determine if the latter type is a possible concrete type of the former.
+
+
+    return schema.isSubType(typeA, typeB);
+  }
+
+  if (isAbstractType(typeB)) {
+    // Determine if the former type is a possible concrete type of the latter.
+    return schema.isSubType(typeB, typeA);
+  } // Otherwise the types do not overlap.
+
+
+  return false;
+}
+
 /**
  * Given a Schema and an AST node describing a type, return a GraphQLType
  * definition which applies to that type. For example, if provided the parsed
@@ -10712,6 +10712,8 @@ function parseLuvioSchema(source, schemaName) {
     });
 }
 
+exports.Kind = Kind;
 exports.LuvioGraphQLSchema = LuvioGraphQLSchema;
+exports.isScalarType = isScalarType;
 exports.parseAndVisit = parseAndVisit;
 exports.parseLuvioSchema = parseLuvioSchema;

package/dist/luvioGraphqlParser.mjs

@@ -3839,6 +3839,115 @@ function isTypeExtensionNode(node) {
   return node.kind === Kind.SCALAR_TYPE_EXTENSION || node.kind === Kind.OBJECT_TYPE_EXTENSION || node.kind === Kind.INTERFACE_TYPE_EXTENSION || node.kind === Kind.UNION_TYPE_EXTENSION || node.kind === Kind.ENUM_TYPE_EXTENSION || node.kind === Kind.INPUT_OBJECT_TYPE_EXTENSION;
 }
 
+/* eslint-disable no-redeclare */
+// $FlowFixMe[name-already-bound]
+var find = Array.prototype.find ? function (list, predicate) {
+  return Array.prototype.find.call(list, predicate);
+} : function (list, predicate) {
+  for (var _i2 = 0; _i2 < list.length; _i2++) {
+    var value = list[_i2];
+
+    if (predicate(value)) {
+      return value;
+    }
+  }
+};
+var find$1 = find;
+
+/* eslint-disable no-redeclare */
+// $FlowFixMe[name-already-bound]
+var arrayFrom = Array.from || function (obj, mapFn, thisArg) {
+  if (obj == null) {
+    throw new TypeError('Array.from requires an array-like object - not null or undefined');
+  } // Is Iterable?
+
+
+  var iteratorMethod = obj[SYMBOL_ITERATOR];
+
+  if (typeof iteratorMethod === 'function') {
+    var iterator = iteratorMethod.call(obj);
+    var result = [];
+    var step;
+
+    for (var i = 0; !(step = iterator.next()).done; ++i) {
+      result.push(mapFn.call(thisArg, step.value, i)); // Infinite Iterators could cause forEach to run forever.
+      // After a very large number of iterations, produce an error.
+      // istanbul ignore if (Too big to actually test)
+
+      if (i > 9999999) {
+        throw new TypeError('Near-infinite iteration.');
+      }
+    }
+
+    return result;
+  } // Is Array like?
+
+
+  var length = obj.length;
+
+  if (typeof length === 'number' && length >= 0 && length % 1 === 0) {
+    var _result = [];
+
+    for (var _i = 0; _i < length; ++_i) {
+      if (Object.prototype.hasOwnProperty.call(obj, _i)) {
+        _result.push(mapFn.call(thisArg, obj[_i], _i));
+      }
+    }
+
+    return _result;
+  }
+
+  return [];
+};
+
+var arrayFrom$1 = arrayFrom;
+
+/* eslint-disable no-redeclare */
+// $FlowFixMe[name-already-bound] workaround for: https://github.com/facebook/flow/issues/4441
+var objectValues = Object.values || function (obj) {
+  return Object.keys(obj).map(function (key) {
+    return obj[key];
+  });
+};
+
+var objectValues$1 = objectValues;
+
+/* eslint-disable no-redeclare */
+// $FlowFixMe[name-already-bound] workaround for: https://github.com/facebook/flow/issues/4441
+var objectEntries = Object.entries || function (obj) {
+  return Object.keys(obj).map(function (key) {
+    return [key, obj[key]];
+  });
+};
+
+var objectEntries$1 = objectEntries;
+
+function toObjMap(obj) {
+  /* eslint-enable no-redeclare */
+  if (Object.getPrototypeOf(obj) === null) {
+    return obj;
+  }
+
+  var map = Object.create(null);
+
+  for (var _i2 = 0, _objectEntries2 = objectEntries$1(obj); _i2 < _objectEntries2.length; _i2++) {
+    var _ref2 = _objectEntries2[_i2];
+    var key = _ref2[0];
+    var value = _ref2[1];
+    map[key] = value;
+  }
+
+  return map;
+}
+
+/* eslint-disable no-redeclare */
+// $FlowFixMe[name-already-bound] workaround for: https://github.com/facebook/flow/issues/4441
+var isFinitePolyfill = Number.isFinite || function (value) {
+  return typeof value === 'number' && isFinite(value);
+};
+
+var isFinite$1 = isFinitePolyfill;
+
 function _typeof(obj) { "@babel/helpers - typeof"; if (typeof Symbol === "function" && typeof Symbol.iterator === "symbol") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; } return _typeof(obj); }
 /**
  * Safer version of `Array.from` that return `null` if value isn't convertible to array.
@@ -3904,40 +4013,13 @@ function safeArrayFrom(collection) {
   return null;
 }
 
-/* eslint-disable no-redeclare */
-// $FlowFixMe[name-already-bound]
-var find = Array.prototype.find ? function (list, predicate) {
-  return Array.prototype.find.call(list, predicate);
-} : function (list, predicate) {
-  for (var _i2 = 0; _i2 < list.length; _i2++) {
-    var value = list[_i2];
-
-    if (predicate(value)) {
-      return value;
-    }
-  }
-};
-var find$1 = find;
-
-/* eslint-disable no-redeclare */
-// $FlowFixMe[name-already-bound] workaround for: https://github.com/facebook/flow/issues/4441
-var objectValues = Object.values || function (obj) {
-  return Object.keys(obj).map(function (key) {
-    return obj[key];
-  });
-};
-
-var objectValues$1 = objectValues;
-
 /* eslint-disable no-redeclare */
 // $FlowFixMe[name-already-bound] workaround for: https://github.com/facebook/flow/issues/4441
-var objectEntries = Object.entries || function (obj) {
-  return Object.keys(obj).map(function (key) {
-    return [key, obj[key]];
-  });
+var isInteger = Number.isInteger || function (value) {
+  return typeof value === 'number' && isFinite(value) && Math.floor(value) === value;
 };
 
-var objectEntries$1 = objectEntries;
+var isInteger$1 = isInteger;
 
 /**
  * Creates a keyed JS object from an array, given a function to produce the keys
@@ -3986,24 +4068,6 @@ function mapValue(map, fn) {
   return result;
 }
 
-function toObjMap(obj) {
-  /* eslint-enable no-redeclare */
-  if (Object.getPrototypeOf(obj) === null) {
-    return obj;
-  }
-
-  var map = Object.create(null);
-
-  for (var _i2 = 0, _objectEntries2 = objectEntries$1(obj); _i2 < _objectEntries2.length; _i2++) {
-    var _ref2 = _objectEntries2[_i2];
-    var key = _ref2[0];
-    var value = _ref2[1];
-    map[key] = value;
-  }
-
-  return map;
-}
-
 /**
  * Creates a keyed JS object from an array, given a function to produce the keys
  * and a function to produce the values from each item in the array.
@@ -5287,151 +5351,6 @@ function isRequiredInputField(field) {
   return isNonNullType(field.type) && field.defaultValue === undefined;
 }
 
-/**
- * Provided a type and a super type, return true if the first type is either
- * equal or a subset of the second super type (covariant).
- */
-
-function isTypeSubTypeOf(schema, maybeSubType, superType) {
-  // Equivalent type is a valid subtype
-  if (maybeSubType === superType) {
-    return true;
-  } // If superType is non-null, maybeSubType must also be non-null.
-
-
-  if (isNonNullType(superType)) {
-    if (isNonNullType(maybeSubType)) {
-      return isTypeSubTypeOf(schema, maybeSubType.ofType, superType.ofType);
-    }
-
-    return false;
-  }
-
-  if (isNonNullType(maybeSubType)) {
-    // If superType is nullable, maybeSubType may be non-null or nullable.
-    return isTypeSubTypeOf(schema, maybeSubType.ofType, superType);
-  } // If superType type is a list, maybeSubType type must also be a list.
-
-
-  if (isListType(superType)) {
-    if (isListType(maybeSubType)) {
-      return isTypeSubTypeOf(schema, maybeSubType.ofType, superType.ofType);
-    }
-
-    return false;
-  }
-
-  if (isListType(maybeSubType)) {
-    // If superType is not a list, maybeSubType must also be not a list.
-    return false;
-  } // If superType type is an abstract type, check if it is super type of maybeSubType.
-  // Otherwise, the child type is not a valid subtype of the parent type.
-
-
-  return isAbstractType(superType) && (isInterfaceType(maybeSubType) || isObjectType(maybeSubType)) && schema.isSubType(superType, maybeSubType);
-}
-/**
- * Provided two composite types, determine if they "overlap". Two composite
- * types overlap when the Sets of possible concrete types for each intersect.
- *
- * This is often used to determine if a fragment of a given type could possibly
- * be visited in a context of another type.
- *
- * This function is commutative.
- */
-
-function doTypesOverlap(schema, typeA, typeB) {
-  // Equivalent types overlap
-  if (typeA === typeB) {
-    return true;
-  }
-
-  if (isAbstractType(typeA)) {
-    if (isAbstractType(typeB)) {
-      // If both types are abstract, then determine if there is any intersection
-      // between possible concrete types of each.
-      return schema.getPossibleTypes(typeA).some(function (type) {
-        return schema.isSubType(typeB, type);
-      });
-    } // Determine if the latter type is a possible concrete type of the former.
-
-
-    return schema.isSubType(typeA, typeB);
-  }
-
-  if (isAbstractType(typeB)) {
-    // Determine if the former type is a possible concrete type of the latter.
-    return schema.isSubType(typeB, typeA);
-  } // Otherwise the types do not overlap.
-
-
-  return false;
-}
-
-/* eslint-disable no-redeclare */
-// $FlowFixMe[name-already-bound]
-var arrayFrom = Array.from || function (obj, mapFn, thisArg) {
-  if (obj == null) {
-    throw new TypeError('Array.from requires an array-like object - not null or undefined');
-  } // Is Iterable?
-
-
-  var iteratorMethod = obj[SYMBOL_ITERATOR];
-
-  if (typeof iteratorMethod === 'function') {
-    var iterator = iteratorMethod.call(obj);
-    var result = [];
-    var step;
-
-    for (var i = 0; !(step = iterator.next()).done; ++i) {
-      result.push(mapFn.call(thisArg, step.value, i)); // Infinite Iterators could cause forEach to run forever.
-      // After a very large number of iterations, produce an error.
-      // istanbul ignore if (Too big to actually test)
-
-      if (i > 9999999) {
-        throw new TypeError('Near-infinite iteration.');
-      }
-    }
-
-    return result;
-  } // Is Array like?
-
-
-  var length = obj.length;
-
-  if (typeof length === 'number' && length >= 0 && length % 1 === 0) {
-    var _result = [];
-
-    for (var _i = 0; _i < length; ++_i) {
-      if (Object.prototype.hasOwnProperty.call(obj, _i)) {
-        _result.push(mapFn.call(thisArg, obj[_i], _i));
-      }
-    }
-
-    return _result;
-  }
-
-  return [];
-};
-
-var arrayFrom$1 = arrayFrom;
-
-/* eslint-disable no-redeclare */
-// $FlowFixMe[name-already-bound] workaround for: https://github.com/facebook/flow/issues/4441
-var isFinitePolyfill = Number.isFinite || function (value) {
-  return typeof value === 'number' && isFinite(value);
-};
-
-var isFinite$1 = isFinitePolyfill;
-
-/* eslint-disable no-redeclare */
-// $FlowFixMe[name-already-bound] workaround for: https://github.com/facebook/flow/issues/4441
-var isInteger = Number.isInteger || function (value) {
-  return typeof value === 'number' && isFinite(value) && Math.floor(value) === value;
-};
-
-var isInteger$1 = isInteger;
-
 // 32-bit signed integer, providing the broadest support across platforms.
 //
 // n.b. JavaScript's integers are safe between -(2^53 - 1) and 2^53 - 1 because
@@ -6908,6 +6827,87 @@ function collectReferencedTypes(type, typeSet) {
   return typeSet;
 }
 
+/**
+ * Provided a type and a super type, return true if the first type is either
+ * equal or a subset of the second super type (covariant).
+ */
+
+function isTypeSubTypeOf(schema, maybeSubType, superType) {
+  // Equivalent type is a valid subtype
+  if (maybeSubType === superType) {
+    return true;
+  } // If superType is non-null, maybeSubType must also be non-null.
+
+
+  if (isNonNullType(superType)) {
+    if (isNonNullType(maybeSubType)) {
+      return isTypeSubTypeOf(schema, maybeSubType.ofType, superType.ofType);
+    }
+
+    return false;
+  }
+
+  if (isNonNullType(maybeSubType)) {
+    // If superType is nullable, maybeSubType may be non-null or nullable.
+    return isTypeSubTypeOf(schema, maybeSubType.ofType, superType);
+  } // If superType type is a list, maybeSubType type must also be a list.
+
+
+  if (isListType(superType)) {
+    if (isListType(maybeSubType)) {
+      return isTypeSubTypeOf(schema, maybeSubType.ofType, superType.ofType);
+    }
+
+    return false;
+  }
+
+  if (isListType(maybeSubType)) {
+    // If superType is not a list, maybeSubType must also be not a list.
+    return false;
+  } // If superType type is an abstract type, check if it is super type of maybeSubType.
+  // Otherwise, the child type is not a valid subtype of the parent type.
+
+
+  return isAbstractType(superType) && (isInterfaceType(maybeSubType) || isObjectType(maybeSubType)) && schema.isSubType(superType, maybeSubType);
+}
+/**
+ * Provided two composite types, determine if they "overlap". Two composite
+ * types overlap when the Sets of possible concrete types for each intersect.
+ *
+ * This is often used to determine if a fragment of a given type could possibly
+ * be visited in a context of another type.
+ *
+ * This function is commutative.
+ */
+
+function doTypesOverlap(schema, typeA, typeB) {
+  // Equivalent types overlap
+  if (typeA === typeB) {
+    return true;
+  }
+
+  if (isAbstractType(typeA)) {
+    if (isAbstractType(typeB)) {
+      // If both types are abstract, then determine if there is any intersection
+      // between possible concrete types of each.
+      return schema.getPossibleTypes(typeA).some(function (type) {
+        return schema.isSubType(typeB, type);
+      });
+    } // Determine if the latter type is a possible concrete type of the former.
+
+
+    return schema.isSubType(typeA, typeB);
+  }
+
+  if (isAbstractType(typeB)) {
+    // Determine if the former type is a possible concrete type of the latter.
+    return schema.isSubType(typeB, typeA);
+  } // Otherwise the types do not overlap.
+
+
+  return false;
+}
+
 /**
  * Given a Schema and an AST node describing a type, return a GraphQLType
  * definition which applies to that type. For example, if provided the parsed
@@ -10708,4 +10708,4 @@ function parseLuvioSchema(source, schemaName) {
     });
 }
 
-export { LuvioGraphQLSchema, parseAndVisit, parseLuvioSchema };
+export { Kind, LuvioGraphQLSchema, isScalarType, parseAndVisit, parseLuvioSchema };

package/dist/main.d.ts

@@ -1,4 +1,5 @@
-import { BooleanValueNode, FloatValueNode, IntValueNode, StringValueNode } from 'graphql/language';
+import { BooleanValueNode, EnumTypeDefinitionNode, FieldDefinitionNode, FloatValueNode, InterfaceTypeDefinitionNode, IntValueNode, Kind, NamedTypeNode, ObjectTypeDefinitionNode, StringValueNode, TypeNode, UnionTypeDefinitionNode } from 'graphql/language';
+import { isScalarType } from 'graphql/type';
 import { LuvioDocumentNode, LuvioArgumentNode, LuvioDefinitionNode, LuvioObjectValueNode, LuvioOperationDefinitionNode, LuvioSelectionCustomFieldNode, LuvioSelectionNode, LuvioSelectionObjectFieldNode, LuvioSelectionScalarFieldNode, LuvioValueNode, LuvioFieldNode, LuvioVariableDefinitionNode, LuvioVariableNode, LuvioNamedTypeNode, LuvioListTypeNode, LuvioListValueNode, LuvioTypeNode } from './ast';
 import { LuvioGraphQLSchema } from './luvio-schema';
 export declare function parseAndVisit(source: string): LuvioDocumentNode;
@@ -7,4 +8,4 @@ export { LuvioGraphQLSchema };
 /**
  * @deprecated - Schema-backed adapters will use standard graphql types re-exported from @luvio/graphql
  */
-export { BooleanValueNode, FloatValueNode, IntValueNode, StringValueNode, LuvioDocumentNode, LuvioArgumentNode, LuvioDefinitionNode, LuvioObjectValueNode, LuvioOperationDefinitionNode, LuvioSelectionCustomFieldNode, LuvioSelectionNode, LuvioSelectionObjectFieldNode, LuvioSelectionScalarFieldNode, LuvioValueNode, LuvioFieldNode, LuvioVariableDefinitionNode, LuvioVariableNode, LuvioNamedTypeNode, LuvioListTypeNode, LuvioListValueNode, LuvioTypeNode, };
+export { isScalarType, BooleanValueNode, EnumTypeDefinitionNode, FieldDefinitionNode, FloatValueNode, InterfaceTypeDefinitionNode, IntValueNode, Kind, NamedTypeNode, ObjectTypeDefinitionNode, StringValueNode, TypeNode, UnionTypeDefinitionNode, LuvioDocumentNode, LuvioArgumentNode, LuvioDefinitionNode, LuvioObjectValueNode, LuvioOperationDefinitionNode, LuvioSelectionCustomFieldNode, LuvioSelectionNode, LuvioSelectionObjectFieldNode, LuvioSelectionScalarFieldNode, LuvioValueNode, LuvioFieldNode, LuvioVariableDefinitionNode, LuvioVariableNode, LuvioNamedTypeNode, LuvioListTypeNode, LuvioListValueNode, LuvioTypeNode, };

package/package.json

@@ -1,6 +1,6 @@
 {
     "name": "@luvio/graphql-parser",
-    "version": "0.75.1",
+    "version": "0.77.1",
     "description": "GraphQL parser for Luvio GraphQL adapter support",
     "main": "./dist/luvioGraphqlParser.js",
     "module": "./dist/luvioGraphqlParser.mjs",

package/src/main.ts

@@ -1,11 +1,19 @@
 import {
     parse,
     BooleanValueNode,
+    EnumTypeDefinitionNode,
+    FieldDefinitionNode,
     FloatValueNode,
+    InterfaceTypeDefinitionNode,
     IntValueNode,
+    Kind,
+    NamedTypeNode,
+    ObjectTypeDefinitionNode,
     StringValueNode,
+    TypeNode,
+    UnionTypeDefinitionNode,
 } from 'graphql/language';
-
+import { isScalarType } from 'graphql/type';
 import { buildASTSchema } from 'graphql/utilities';
 import {
     LuvioDocumentNode,
@@ -51,10 +59,19 @@ export { LuvioGraphQLSchema };
  * @deprecated - Schema-backed adapters will use standard graphql types re-exported from @luvio/graphql
  */
 export {
+    isScalarType,
     BooleanValueNode,
+    EnumTypeDefinitionNode,
+    FieldDefinitionNode,
     FloatValueNode,
+    InterfaceTypeDefinitionNode,
     IntValueNode,
+    Kind,
+    NamedTypeNode,
+    ObjectTypeDefinitionNode,
     StringValueNode,
+    TypeNode,
+    UnionTypeDefinitionNode,
     LuvioDocumentNode,
     LuvioArgumentNode,
     LuvioDefinitionNode,