relay-compiler 9.0.0 → 10.1.0

package/lib/runner/GraphQLASTNodeGroup.js

@@ -14,6 +14,12 @@ var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefau
 
 var _toConsumableArray2 = _interopRequireDefault(require("@babel/runtime/helpers/toConsumableArray"));
 
+function _createForOfIteratorHelper(o, allowArrayLike) { var it; if (typeof Symbol === "undefined" || o[Symbol.iterator] == null) { if (Array.isArray(o) || (it = _unsupportedIterableToArray(o)) || allowArrayLike && o && typeof o.length === "number") { if (it) o = it; var i = 0; var F = function F() {}; return { s: F, n: function n() { if (i >= o.length) return { done: true }; return { done: false, value: o[i++] }; }, e: function e(_e) { throw _e; }, f: F }; } throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); } var normalCompletion = true, didErr = false, err; return { s: function s() { it = o[Symbol.iterator](); }, n: function n() { var step = it.next(); normalCompletion = step.done; return step; }, e: function e(_e2) { didErr = true; err = _e2; }, f: function f() { try { if (!normalCompletion && it["return"] != null) it["return"](); } finally { if (didErr) throw err; } } }; }
+
+function _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === "string") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === "Object" && o.constructor) n = o.constructor.name; if (n === "Map" || n === "Set") return Array.from(o); if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }
+
+function _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0, arr2 = new Array(len); i < len; i++) { arr2[i] = arr[i]; } return arr2; }
+
 var GraphQLNodeMap = require('./GraphQLNodeMap');
 
 var _require = require('./GraphQLASTUtils'),
@@ -24,12 +30,12 @@ var _require2 = require('graphql'),
 
 function buildDependencyMap(nodes) {
   var dependencyMap = new Map();
-  var _iteratorNormalCompletion = true;
-  var _didIteratorError = false;
-  var _iteratorError = undefined;
+
+  var _iterator = _createForOfIteratorHelper(nodes.values()),
+      _step;
 
   try {
-    for (var _iterator = nodes.values()[Symbol.iterator](), _step; !(_iteratorNormalCompletion = (_step = _iterator.next()).done); _iteratorNormalCompletion = true) {
+    for (_iterator.s(); !(_step = _iterator.n()).done;) {
       var node = _step.value;
       var name = getName(node);
 
@@ -40,18 +46,9 @@ function buildDependencyMap(nodes) {
       dependencyMap.set(name, findIncludedFragments(node));
     }
   } catch (err) {
-    _didIteratorError = true;
-    _iteratorError = err;
+    _iterator.e(err);
   } finally {
-    try {
-      if (!_iteratorNormalCompletion && _iterator["return"] != null) {
-        _iterator["return"]();
-      }
-    } finally {
-      if (_didIteratorError) {
-        throw _iteratorError;
-      }
-    }
+    _iterator.f();
   }
 
   return dependencyMap;
@@ -59,19 +56,19 @@ function buildDependencyMap(nodes) {
 
 function mergeMaps(maps) {
   var result = new Map();
-  var _iteratorNormalCompletion2 = true;
-  var _didIteratorError2 = false;
-  var _iteratorError2 = undefined;
+
+  var _iterator2 = _createForOfIteratorHelper(maps),
+      _step2;
 
   try {
-    for (var _iterator2 = maps[Symbol.iterator](), _step2; !(_iteratorNormalCompletion2 = (_step2 = _iterator2.next()).done); _iteratorNormalCompletion2 = true) {
+    for (_iterator2.s(); !(_step2 = _iterator2.n()).done;) {
       var source = _step2.value;
-      var _iteratorNormalCompletion3 = true;
-      var _didIteratorError3 = false;
-      var _iteratorError3 = undefined;
+
+      var _iterator3 = _createForOfIteratorHelper(source.entries()),
+          _step3;
 
       try {
-        for (var _iterator3 = source.entries()[Symbol.iterator](), _step3; !(_iteratorNormalCompletion3 = (_step3 = _iterator3.next()).done); _iteratorNormalCompletion3 = true) {
+        for (_iterator3.s(); !(_step3 = _iterator3.n()).done;) {
           var _step3$value = _step3.value,
               key = _step3$value[0],
               value = _step3$value[1];
@@ -83,33 +80,15 @@ function mergeMaps(maps) {
           result.set(key, value);
         }
       } catch (err) {
-        _didIteratorError3 = true;
-        _iteratorError3 = err;
+        _iterator3.e(err);
       } finally {
-        try {
-          if (!_iteratorNormalCompletion3 && _iterator3["return"] != null) {
-            _iterator3["return"]();
-          }
-        } finally {
-          if (_didIteratorError3) {
-            throw _iteratorError3;
-          }
-        }
+        _iterator3.f();
       }
     }
   } catch (err) {
-    _didIteratorError2 = true;
-    _iteratorError2 = err;
+    _iterator2.e(err);
   } finally {
-    try {
-      if (!_iteratorNormalCompletion2 && _iterator2["return"] != null) {
-        _iterator2["return"]();
-      }
-    } finally {
-      if (_didIteratorError2) {
-        throw _iteratorError2;
-      }
-    }
+    _iterator2.f();
   }
 
   return result;
@@ -133,12 +112,12 @@ function forChanges(nodes, changedNames) {
   var directlyChangedAndAncestors = includeReachable(changedNames, invertedDependencyMap); // Now, we need to intersect obtained set with the project nodes
 
   var directlyChangedRelatedToProject = new Set();
-  var _iteratorNormalCompletion4 = true;
-  var _didIteratorError4 = false;
-  var _iteratorError4 = undefined;
+
+  var _iterator4 = _createForOfIteratorHelper(directlyChangedAndAncestors),
+      _step4;
 
   try {
-    for (var _iterator4 = directlyChangedAndAncestors[Symbol.iterator](), _step4; !(_iteratorNormalCompletion4 = (_step4 = _iterator4.next()).done); _iteratorNormalCompletion4 = true) {
+    for (_iterator4.s(); !(_step4 = _iterator4.n()).done;) {
       var node = _step4.value;
 
       if (nodes.has(node)) {
@@ -148,18 +127,9 @@ function forChanges(nodes, changedNames) {
     // in the complete dependency map (project + base)
 
   } catch (err) {
-    _didIteratorError4 = true;
-    _iteratorError4 = err;
+    _iterator4.e(err);
   } finally {
-    try {
-      if (!_iteratorNormalCompletion4 && _iterator4["return"] != null) {
-        _iterator4["return"]();
-      }
-    } finally {
-      if (_didIteratorError4) {
-        throw _iteratorError4;
-      }
-    }
+    _iterator4.f();
   }
 
   var allRelated = includeReachable(directlyChangedRelatedToProject, dependencyMap);
@@ -169,12 +139,12 @@ function forChanges(nodes, changedNames) {
 function buildResult(includedNames, nameToNode, baseNameToNode) {
   var baseNames = new Set();
   var nodes = [];
-  var _iteratorNormalCompletion5 = true;
-  var _didIteratorError5 = false;
-  var _iteratorError5 = undefined;
+
+  var _iterator5 = _createForOfIteratorHelper(includedNames),
+      _step5;
 
   try {
-    for (var _iterator5 = includedNames[Symbol.iterator](), _step5; !(_iteratorNormalCompletion5 = (_step5 = _iterator5.next()).done); _iteratorNormalCompletion5 = true) {
+    for (_iterator5.s(); !(_step5 = _iterator5.n()).done;) {
       var name = _step5.value;
       var baseNode = baseNameToNode.get(name);
 
@@ -190,18 +160,9 @@ function buildResult(includedNames, nameToNode, baseNameToNode) {
       }
     }
   } catch (err) {
-    _didIteratorError5 = true;
-    _iteratorError5 = err;
+    _iterator5.e(err);
   } finally {
-    try {
-      if (!_iteratorNormalCompletion5 && _iterator5["return"] != null) {
-        _iterator5["return"]();
-      }
-    } finally {
-      if (_didIteratorError5) {
-        throw _iteratorError5;
-      }
-    }
+    _iterator5.f();
   }
 
   return {
@@ -217,12 +178,12 @@ function includeReachable(changed, deps) {
   while (toVisit.length > 0) {
     var current = toVisit.pop();
     visited.add(current);
-    var _iteratorNormalCompletion6 = true;
-    var _didIteratorError6 = false;
-    var _iteratorError6 = undefined;
+
+    var _iterator6 = _createForOfIteratorHelper(deps.get(current) || []),
+        _step6;
 
     try {
-      for (var _iterator6 = (deps.get(current) || [])[Symbol.iterator](), _step6; !(_iteratorNormalCompletion6 = (_step6 = _iterator6.next()).done); _iteratorNormalCompletion6 = true) {
+      for (_iterator6.s(); !(_step6 = _iterator6.n()).done;) {
         var dep = _step6.value;
 
         if (!visited.has(dep)) {
@@ -230,18 +191,9 @@ function includeReachable(changed, deps) {
         }
       }
     } catch (err) {
-      _didIteratorError6 = true;
-      _iteratorError6 = err;
+      _iterator6.e(err);
     } finally {
-      try {
-        if (!_iteratorNormalCompletion6 && _iterator6["return"] != null) {
-          _iterator6["return"]();
-        }
-      } finally {
-        if (_didIteratorError6) {
-          throw _iteratorError6;
-        }
-      }
+      _iterator6.f();
     }
   }
 
@@ -260,22 +212,22 @@ function findIncludedFragments(node) {
 
 function inverseDependencyMap(map) {
   var invertedMap = new Map();
-  var _iteratorNormalCompletion7 = true;
-  var _didIteratorError7 = false;
-  var _iteratorError7 = undefined;
+
+  var _iterator7 = _createForOfIteratorHelper(map.entries()),
+      _step7;
 
   try {
-    for (var _iterator7 = map.entries()[Symbol.iterator](), _step7; !(_iteratorNormalCompletion7 = (_step7 = _iterator7.next()).done); _iteratorNormalCompletion7 = true) {
+    for (_iterator7.s(); !(_step7 = _iterator7.n()).done;) {
       var _step7$value = _step7.value,
           source = _step7$value[0],
           dests = _step7$value[1];
       var inverseDest = source;
-      var _iteratorNormalCompletion8 = true;
-      var _didIteratorError8 = false;
-      var _iteratorError8 = undefined;
+
+      var _iterator8 = _createForOfIteratorHelper(dests),
+          _step8;
 
       try {
-        for (var _iterator8 = dests[Symbol.iterator](), _step8; !(_iteratorNormalCompletion8 = (_step8 = _iterator8.next()).done); _iteratorNormalCompletion8 = true) {
+        for (_iterator8.s(); !(_step8 = _iterator8.n()).done;) {
           var dest = _step8.value;
           var inverseSource = dest;
           var inverseDests = invertedMap.get(inverseSource);
@@ -288,33 +240,15 @@ function inverseDependencyMap(map) {
           inverseDests.push(inverseDest);
         }
       } catch (err) {
-        _didIteratorError8 = true;
-        _iteratorError8 = err;
+        _iterator8.e(err);
       } finally {
-        try {
-          if (!_iteratorNormalCompletion8 && _iterator8["return"] != null) {
-            _iterator8["return"]();
-          }
-        } finally {
-          if (_didIteratorError8) {
-            throw _iteratorError8;
-          }
-        }
+        _iterator8.f();
       }
     }
   } catch (err) {
-    _didIteratorError7 = true;
-    _iteratorError7 = err;
+    _iterator7.e(err);
   } finally {
-    try {
-      if (!_iteratorNormalCompletion7 && _iterator7["return"] != null) {
-        _iterator7["return"]();
-      }
-    } finally {
-      if (_didIteratorError7) {
-        throw _iteratorError7;
-      }
-    }
+    _iterator7.f();
   }
 
   return invertedMap;

package/lib/runner/GraphQLNodeMap.js

@@ -16,6 +16,12 @@ var _inheritsLoose2 = _interopRequireDefault(require("@babel/runtime/helpers/inh
 
 var _wrapNativeSuper2 = _interopRequireDefault(require("@babel/runtime/helpers/wrapNativeSuper"));
 
+function _createForOfIteratorHelper(o, allowArrayLike) { var it; if (typeof Symbol === "undefined" || o[Symbol.iterator] == null) { if (Array.isArray(o) || (it = _unsupportedIterableToArray(o)) || allowArrayLike && o && typeof o.length === "number") { if (it) o = it; var i = 0; var F = function F() {}; return { s: F, n: function n() { if (i >= o.length) return { done: true }; return { done: false, value: o[i++] }; }, e: function e(_e) { throw _e; }, f: F }; } throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); } var normalCompletion = true, didErr = false, err; return { s: function s() { it = o[Symbol.iterator](); }, n: function n() { var step = it.next(); normalCompletion = step.done; return step; }, e: function e(_e2) { didErr = true; err = _e2; }, f: function f() { try { if (!normalCompletion && it["return"] != null) it["return"](); } finally { if (didErr) throw err; } } }; }
+
+function _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === "string") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === "Object" && o.constructor) n = o.constructor.name; if (n === "Map" || n === "Set") return Array.from(o); if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }
+
+function _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0, arr2 = new Array(len); i < len; i++) { arr2[i] = arr[i]; } return arr2; }
+
 var _require = require('../core/CompilerError'),
     createUserError = _require.createUserError,
     createCompilerError = _require.createCompilerError;
@@ -23,9 +29,7 @@ var _require = require('../core/CompilerError'),
 var _require2 = require('./GraphQLASTUtils'),
     getName = _require2.getName;
 
-var GraphQLNodeMap =
-/*#__PURE__*/
-function (_Map) {
+var GraphQLNodeMap = /*#__PURE__*/function (_Map) {
   (0, _inheritsLoose2["default"])(GraphQLNodeMap, _Map);
 
   function GraphQLNodeMap() {
@@ -34,12 +38,12 @@ function (_Map) {
 
   GraphQLNodeMap.from = function from(nodes) {
     var result = new GraphQLNodeMap();
-    var _iteratorNormalCompletion = true;
-    var _didIteratorError = false;
-    var _iteratorError = undefined;
+
+    var _iterator = _createForOfIteratorHelper(nodes),
+        _step;
 
     try {
-      for (var _iterator = nodes[Symbol.iterator](), _step; !(_iteratorNormalCompletion = (_step = _iterator.next()).done); _iteratorNormalCompletion = true) {
+      for (_iterator.s(); !(_step = _iterator.n()).done;) {
         var node = _step.value;
         var name = getName(node);
         var prevNode = result.get(name);
@@ -51,18 +55,9 @@ function (_Map) {
         result.set(name, node);
       }
     } catch (err) {
-      _didIteratorError = true;
-      _iteratorError = err;
+      _iterator.e(err);
     } finally {
-      try {
-        if (!_iteratorNormalCompletion && _iterator["return"] != null) {
-          _iterator["return"]();
-        }
-      } finally {
-        if (_didIteratorError) {
-          throw _iteratorError;
-        }
-      }
+      _iterator.f();
     }
 
     return result;
@@ -85,6 +80,6 @@ function (_Map) {
   };
 
   return GraphQLNodeMap;
-}((0, _wrapNativeSuper2["default"])(Map));
+}( /*#__PURE__*/(0, _wrapNativeSuper2["default"])(Map));
 
 module.exports = GraphQLNodeMap;

package/lib/runner/Sources.js

@@ -13,10 +13,22 @@
 
 var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
 
-var _objectSpread2 = _interopRequireDefault(require("@babel/runtime/helpers/objectSpread"));
+var _defineProperty2 = _interopRequireDefault(require("@babel/runtime/helpers/defineProperty"));
+
+function ownKeys(object, enumerableOnly) { var keys = Object.keys(object); if (Object.getOwnPropertySymbols) { var symbols = Object.getOwnPropertySymbols(object); if (enumerableOnly) symbols = symbols.filter(function (sym) { return Object.getOwnPropertyDescriptor(object, sym).enumerable; }); keys.push.apply(keys, symbols); } return keys; }
+
+function _objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i] != null ? arguments[i] : {}; if (i % 2) { ownKeys(Object(source), true).forEach(function (key) { (0, _defineProperty2["default"])(target, key, source[key]); }); } else if (Object.getOwnPropertyDescriptors) { Object.defineProperties(target, Object.getOwnPropertyDescriptors(source)); } else { ownKeys(Object(source)).forEach(function (key) { Object.defineProperty(target, key, Object.getOwnPropertyDescriptor(source, key)); }); } } return target; }
+
+function _createForOfIteratorHelper(o, allowArrayLike) { var it; if (typeof Symbol === "undefined" || o[Symbol.iterator] == null) { if (Array.isArray(o) || (it = _unsupportedIterableToArray(o)) || allowArrayLike && o && typeof o.length === "number") { if (it) o = it; var i = 0; var F = function F() {}; return { s: F, n: function n() { if (i >= o.length) return { done: true }; return { done: false, value: o[i++] }; }, e: function e(_e) { throw _e; }, f: F }; } throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); } var normalCompletion = true, didErr = false, err; return { s: function s() { it = o[Symbol.iterator](); }, n: function n() { var step = it.next(); normalCompletion = step.done; return step; }, e: function e(_e2) { didErr = true; err = _e2; }, f: function f() { try { if (!normalCompletion && it["return"] != null) it["return"](); } finally { if (didErr) throw err; } } }; }
+
+function _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === "string") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === "Object" && o.constructor) n = o.constructor.name; if (n === "Map" || n === "Set") return Array.from(o); if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }
+
+function _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0, arr2 = new Array(len); i < len; i++) { arr2[i] = arr[i]; } return arr2; }
 
 var invariant = require("fbjs/lib/invariant");
 
+var md5 = require('../util/md5');
+
 var _require = require('./extractAST'),
     toASTRecord = _require.toASTRecord;
 
@@ -24,20 +36,14 @@ var _require2 = require('graphql'),
     Source = _require2.Source,
     parse = _require2.parse;
 
-function md5(x) {
-  return require('crypto').createHash('md5').update(x, 'utf8').digest('hex');
-}
-
-var Sources =
-/*#__PURE__*/
-function () {
-  Sources.fromSavedState = function fromSavedState(_ref2) {
-    var extractFromFile = _ref2.extractFromFile,
-        savedState = _ref2.savedState;
+var Sources = /*#__PURE__*/function () {
+  Sources.fromSavedState = function fromSavedState(_ref) {
+    var extractFromFile = _ref.extractFromFile,
+        savedState = _ref.savedState;
     var state = {};
-    var _iteratorNormalCompletion = true;
-    var _didIteratorError = false;
-    var _iteratorError = undefined;
+
+    var _iterator = _createForOfIteratorHelper(savedState),
+        _step;
 
     try {
       var _loop = function _loop() {
@@ -46,12 +52,12 @@ function () {
             savedStateSources = _step$value.sources;
         var nodes = {};
         var sources = [];
-        var _iteratorNormalCompletion2 = true;
-        var _didIteratorError2 = false;
-        var _iteratorError2 = undefined;
+
+        var _iterator2 = _createForOfIteratorHelper(savedStateSources),
+            _step2;
 
         try {
-          for (var _iterator2 = savedStateSources[Symbol.iterator](), _step2; !(_iteratorNormalCompletion2 = (_step2 = _iterator2.next()).done); _iteratorNormalCompletion2 = true) {
+          for (_iterator2.s(); !(_step2 = _iterator2.n()).done;) {
             var text = _step2.value;
             var doc = parse(new Source(text, file));
             !doc.definitions.length ? process.env.NODE_ENV !== "production" ? invariant(false, 'expected not empty list of definitions') : invariant(false) : void 0;
@@ -64,18 +70,9 @@ function () {
             sources.push(text);
           }
         } catch (err) {
-          _didIteratorError2 = true;
-          _iteratorError2 = err;
+          _iterator2.e(err);
         } finally {
-          try {
-            if (!_iteratorNormalCompletion2 && _iterator2["return"] != null) {
-              _iterator2["return"]();
-            }
-          } finally {
-            if (_didIteratorError2) {
-              throw _iteratorError2;
-            }
-          }
+          _iterator2.f();
         }
 
         state[file] = {
@@ -84,22 +81,13 @@ function () {
         };
       };
 
-      for (var _iterator = savedState[Symbol.iterator](), _step; !(_iteratorNormalCompletion = (_step = _iterator.next()).done); _iteratorNormalCompletion = true) {
+      for (_iterator.s(); !(_step = _iterator.n()).done;) {
         _loop();
       }
     } catch (err) {
-      _didIteratorError = true;
-      _iteratorError = err;
+      _iterator.e(err);
     } finally {
-      try {
-        if (!_iteratorNormalCompletion && _iterator["return"] != null) {
-          _iterator["return"]();
-        }
-      } finally {
-        if (_didIteratorError) {
-          throw _iteratorError;
-        }
-      }
+      _iterator.f();
     }
 
     return new Sources({
@@ -108,26 +96,29 @@ function () {
     });
   };
 
-  function Sources(_ref3) {
-    var extractFromFile = _ref3.extractFromFile,
-        state = _ref3.state;
+  function Sources(_ref2) {
+    var extractFromFile = _ref2.extractFromFile,
+        state = _ref2.state;
     this._extractFromFile = extractFromFile;
-    this._state = (0, _objectSpread2["default"])({}, state);
+    this._state = _objectSpread({}, state);
   }
 
   var _proto = Sources.prototype;
 
   _proto.processChanges = function processChanges(baseDir, files) {
+    var _ast$name$value, _ast$name;
+
     var added = [];
     var removed = [];
-    var state = (0, _objectSpread2["default"])({}, this._state);
-    var _iteratorNormalCompletion3 = true;
-    var _didIteratorError3 = false;
-    var _iteratorError3 = undefined;
+
+    var state = _objectSpread({}, this._state);
+
+    var _iterator3 = _createForOfIteratorHelper(files),
+        _step3;
 
     try {
-      for (var _iterator3 = files[Symbol.iterator](), _step3; !(_iteratorNormalCompletion3 = (_step3 = _iterator3.next()).done); _iteratorNormalCompletion3 = true) {
-        var _ref, _state$file$name;
+      for (_iterator3.s(); !(_step3 = _iterator3.n()).done;) {
+        var _state$file$name$node, _state$file$name;
 
         var _file = _step3.value;
         var newDefs = void 0;
@@ -145,23 +136,40 @@ function () {
         }
 
         var hasEntry = state.hasOwnProperty(_file.name);
-        var oldEntry = (_ref = (_state$file$name = state[_file.name]) === null || _state$file$name === void 0 ? void 0 : _state$file$name.nodes) !== null && _ref !== void 0 ? _ref : {}; // First case, we have new changes in the file
+        var oldEntry = (_state$file$name$node = (_state$file$name = state[_file.name]) === null || _state$file$name === void 0 ? void 0 : _state$file$name.nodes) !== null && _state$file$name$node !== void 0 ? _state$file$name$node : {}; // First case, we have new changes in the file
         // for example changed Query or Fragment
 
         if (newDefs != null && newDefs.length > 0) {
           // We need to add all entities from the changed file to added arrays
           var newEntry = {};
           var newTexts = new Set();
-          var _iteratorNormalCompletion4 = true;
-          var _didIteratorError4 = false;
-          var _iteratorError4 = undefined;
+
+          var _iterator4 = _createForOfIteratorHelper(newDefs),
+              _step4;
 
           try {
-            for (var _iterator4 = newDefs[Symbol.iterator](), _step4; !(_iteratorNormalCompletion4 = (_step4 = _iterator4.next()).done); _iteratorNormalCompletion4 = true) {
+            for (_iterator4.s(); !(_step4 = _iterator4.n()).done;) {
               var _step4$value = _step4.value,
                   _ast = _step4$value.ast,
                   text = _step4$value.text;
               var hashedText = md5(text);
+
+              if (newTexts.has(hashedText)) {
+                var name = 'unknown';
+
+                switch (_ast.kind) {
+                  case 'FragmentDefinition':
+                    name = _ast.name.value;
+                    break;
+
+                  case 'OperationDefinition':
+                    name = (_ast$name$value = (_ast$name = _ast.name) === null || _ast$name === void 0 ? void 0 : _ast$name.value) !== null && _ast$name$value !== void 0 ? _ast$name$value : 'unnamed operation';
+                    break;
+                }
+
+                throw new Error("Duplicate definition of `".concat(name, "` in `").concat(_file.name, "`"));
+              }
+
               newTexts.add(hashedText);
 
               if (hasEntry && oldEntry[hashedText] != null) {
@@ -181,18 +189,9 @@ function () {
             // that are not included in the new changes
 
           } catch (err) {
-            _didIteratorError4 = true;
-            _iteratorError4 = err;
+            _iterator4.e(err);
           } finally {
-            try {
-              if (!_iteratorNormalCompletion4 && _iterator4["return"] != null) {
-                _iterator4["return"]();
-              }
-            } finally {
-              if (_didIteratorError4) {
-                throw _iteratorError4;
-              }
-            }
+            _iterator4.f();
           }
 
           if (hasEntry) {
@@ -212,10 +211,7 @@ function () {
 
           state[_file.name] = {
             nodes: newEntry,
-
-            /* $FlowFixMe(>=0.111.0) This comment suppresses an error found when
-             * Flow v0.111.0 was deployed. To see the error, delete this comment
-             * and run Flow. */
+            // $FlowFixMe[incompatible-type]
             sources: newSources
           };
         } else {
@@ -236,24 +232,13 @@ function () {
         }
       }
     } catch (err) {
-      _didIteratorError3 = true;
-      _iteratorError3 = err;
+      _iterator3.e(err);
     } finally {
-      try {
-        if (!_iteratorNormalCompletion3 && _iterator3["return"] != null) {
-          _iterator3["return"]();
-        }
-      } finally {
-        if (_didIteratorError3) {
-          throw _iteratorError3;
-        }
-      }
+      _iterator3.f();
     }
 
     return {
-      /* $FlowFixMe(>=0.111.0) This comment suppresses an error found when Flow
-       * v0.111.0 was deployed. To see the error, delete this comment and run
-       * Flow. */
+      // $FlowFixMe[incompatible-return]
       changes: {
         added: added,
         removed: removed