relay-compiler 10.1.3 → 11.0.2

package/lib/transforms/DeclarativeConnectionMutationTransform.js

@@ -137,7 +137,7 @@ function visitLinkedField(field) {
   var schema = this.getContext().getSchema();
 
   if (edgeDirective) {
-    var fieldType = schema.isList(transformedField.type) ? transformedField.type.ofType : transformedField.type;
+    var fieldType = schema.getRawType(transformedField.type);
     var fields = schema.getFields(fieldType);
     var cursorFieldID;
     var nodeFieldID;

package/lib/transforms/FieldHandleTransform.js

@@ -18,7 +18,7 @@ var IRTransformer = require('../core/IRTransformer');
 
 var SchemaUtils = require('../core/SchemaUtils');
 
-var invariant = require("fbjs/lib/invariant");
+var invariant = require('invariant');
 
 var nullthrows = require('nullthrows');
 

package/lib/transforms/FlattenTransform.js

@@ -16,7 +16,7 @@ var _objectSpread2 = _interopRequireDefault(require("@babel/runtime/helpers/obje
 
 var IRTransformer = require('../core/IRTransformer');
 
-var areEqual = require('../util/areEqualOSS');
+var areEqualArgValues = require('../util/areEqualArgValues');
 
 var getIdentifierForSelection = require('../core/getIdentifierForSelection');
 
@@ -268,7 +268,7 @@ function areEqualFields(thisField, thatField) {
 function areEqualArgs(thisArgs, thatArgs) {
   return thisArgs.length === thatArgs.length && thisArgs.every(function (thisArg, index) {
     var thatArg = thatArgs[index];
-    return thisArg.name === thatArg.name && thisArg.value.kind === thatArg.value.kind && thisArg.value.variableName === thatArg.value.variableName && areEqual(thisArg.value.value, thatArg.value.value);
+    return thisArg.name === thatArg.name && thisArg.value.kind === thatArg.value.kind && thisArg.value.variableName === thatArg.value.variableName && areEqualArgValues(thisArg.value.value, thatArg.value.value);
   });
 }
 /**
@@ -286,9 +286,12 @@ function mergeHandles(nodeA, nodeB) {
   }
 
   var uniqueItems = new Map();
-  nodeA.handles.concat(nodeB.handles).forEach(function (item) {
+  nodeA.handles // $FlowFixMe[incompatible-use]
+  .concat(nodeB.handles) // $FlowFixMe[incompatible-use]
+  .forEach(function (item) {
     return uniqueItems.set(item.name + item.key, item);
-  });
+  }); // $FlowFixMe[incompatible-return]
+
   return Array.from(uniqueItems.values());
 }
 

package/lib/transforms/InlineFragmentsTransform.js

@@ -12,7 +12,7 @@
 
 var IRTransformer = require('../core/IRTransformer');
 
-var invariant = require("fbjs/lib/invariant");
+var invariant = require('invariant');
 
 /**
  * A transform that inlines all fragments and removes them.

package/lib/transforms/MaskTransform.js

@@ -18,7 +18,7 @@ var _objectSpread2 = _interopRequireDefault(require("@babel/runtime/helpers/obje
 
 var IRTransformer = require('../core/IRTransformer');
 
-var invariant = require("fbjs/lib/invariant");
+var invariant = require('invariant');
 
 var joinArgumentDefinitions = require('../util/joinArgumentDefinitions');
 

package/lib/transforms/RelayDirectiveTransform.js

@@ -18,7 +18,7 @@ var IRTransformer = require('../core/IRTransformer');
 
 var getLiteralArgumentValues = require('../core/getLiteralArgumentValues');
 
-var invariant = require("fbjs/lib/invariant");
+var invariant = require('invariant');
 
 var RELAY = 'relay';
 var SCHEMA_EXTENSION = "\ndirective @relay(\n  # Marks a fragment as being backed by a GraphQLList.\n  plural: Boolean,\n\n  # Marks a fragment spread which should be unmasked if provided false\n  mask: Boolean = true,\n) on FRAGMENT_DEFINITION | FRAGMENT_SPREAD\n";

package/lib/transforms/SkipRedundantNodesTransform.js

@@ -24,7 +24,7 @@ var partitionArray = require('../util/partitionArray');
 
 var getIdentifierForSelection = require('../core/getIdentifierForSelection');
 
-var invariant = require("fbjs/lib/invariant");
+var invariant = require('invariant');
 
 /**
  * A transform that removes redundant fields and fragment spreads. Redundancy is
@@ -227,7 +227,8 @@ function transformNode(schema, node, selectionMap) {
   if (isEmptySelectionMap) {
     // $FlowFixMe[escaped-generic]
     cache.set(node, result);
-  }
+  } // $FlowFixMe[incompatible-return]
+
 
   return result;
 }

package/lib/transforms/SkipUnreachableNodeTransform.js

@@ -18,7 +18,7 @@ var _toConsumableArray2 = _interopRequireDefault(require("@babel/runtime/helpers
 
 var IRTransformer = require('../core/IRTransformer');
 
-var invariant = require("fbjs/lib/invariant");
+var invariant = require('invariant');
 
 var FAIL = 'fail';
 var PASS = 'pass';

package/lib/util/{areEqualOSS.js → areEqualArgValues.js}

@@ -7,6 +7,7 @@
  * 
  * @format
  */
+// TODO: This is only used with `ArgumentValue` types, so it could be simpler.
 // flowlint ambiguous-object-type:error
 'use strict';
 
@@ -21,7 +22,7 @@ var bStackPool = [];
  * @license MIT
  */
 
-function areEqual(a, b) {
+function areEqualArgValues(a, b) {
   var aStack = aStackPool.length ? aStackPool.pop() : [];
   var bStack = bStackPool.length ? bStackPool.pop() : [];
   var result = eq(a, b, aStack, bStack);
@@ -115,7 +116,7 @@ function eq(a, b, aStack, bStack) {
         // HACK: Comparing deeply nested React trees is slow since you end up
         // comparing the entire tree (all ancestors and all children) and
         // likely not what you want if you're comparing two elements with
-        // areEqual. We bail out here for now.
+        // areEqualArgValues. We bail out here for now.
         continue;
       }
 
@@ -130,4 +131,4 @@ function eq(a, b, aStack, bStack) {
   return true;
 }
 
-module.exports = areEqual;
+module.exports = areEqualArgValues;

package/package.json

@@ -1,7 +1,7 @@
 {
   "name": "relay-compiler",
   "description": "A compiler tool for building GraphQL-driven applications.",
-  "version": "10.1.3",
+  "version": "11.0.2",
   "keywords": [
     "graphql",
     "relay"
@@ -27,8 +27,9 @@
     "fbjs": "^3.0.0",
     "glob": "^7.1.1",
     "immutable": "~3.7.6",
+    "invariant": "^2.2.4",
     "nullthrows": "^1.1.1",
-    "relay-runtime": "10.1.3",
+    "relay-runtime": "11.0.2",
     "signedsource": "^1.0.0",
     "yargs": "^15.3.1"
   },