relay-compiler 10.1.3 → 11.0.2

package/runner/BufferedFilesystem.js.flow

@@ -144,7 +144,7 @@ class BufferedFilesystem implements Filesystem {
     return fs.readFileSync(path, encoding);
   }
 
-  statSync(path: string): {isDirectory(): boolean, ...} {
+  statSync(path: string): interface {isDirectory(): boolean} {
     this._assertNotComitted();
     return fs.statSync(path);
   }

package/transforms/DeclarativeConnectionMutationTransform.js.flow

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

package/transforms/FlattenTransform.js.flow

@@ -14,7 +14,7 @@
 
 const IRTransformer = require('../core/IRTransformer');
 
-const areEqual = require('../util/areEqualOSS');
+const areEqualArgValues = require('../util/areEqualArgValues');
 const getIdentifierForSelection = require('../core/getIdentifierForSelection');
 
 const {createCompilerError, createUserError} = require('../core/CompilerError');
@@ -415,7 +415,10 @@ function areEqualArgs(
         thisArg.value.kind === thatArg.value.kind &&
         (thisArg.value: any).variableName ===
           (thatArg.value: any).variableName &&
-        areEqual((thisArg.value: any).value, (thatArg.value: any).value)
+        areEqualArgValues(
+          (thisArg.value: any).value,
+          (thatArg.value: any).value,
+        )
       );
     })
   );
@@ -436,8 +439,11 @@ function mergeHandles<T: LinkedField | ScalarField>(
   }
   const uniqueItems = new Map();
   nodeA.handles
+    // $FlowFixMe[incompatible-use]
     .concat(nodeB.handles)
+    // $FlowFixMe[incompatible-use]
     .forEach(item => uniqueItems.set(item.name + item.key, item));
+  // $FlowFixMe[incompatible-return]
   return Array.from(uniqueItems.values());
 }
 

package/transforms/SkipRedundantNodesTransform.js.flow

@@ -234,6 +234,7 @@ function transformNode<T: Node>(
     // $FlowFixMe[escaped-generic]
     cache.set(node, result);
   }
+  // $FlowFixMe[incompatible-return]
   return result;
 }
 

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

@@ -8,6 +8,8 @@
  * @format
  */
 
+// TODO: This is only used with `ArgumentValue` types, so it could be simpler.
+
 // flowlint ambiguous-object-type:error
 'use strict';
 
@@ -22,7 +24,7 @@ const bStackPool = [];
  * @copyright 2009-2013 Jeremy Ashkenas, DocumentCloud Inc.
  * @license MIT
  */
-function areEqual(a: any, b: any): boolean {
+function areEqualArgValues(a: any, b: any): boolean {
   const aStack = aStackPool.length ? aStackPool.pop() : [];
   const bStack = bStackPool.length ? bStackPool.pop() : [];
   const result = eq(a, b, aStack, bStack);
@@ -104,7 +106,7 @@ function eq(a: any, b: any, aStack: Array<any>, bStack: Array<any>): boolean {
         // 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;
       }
       if (
@@ -120,4 +122,4 @@ function eq(a: any, b: any, aStack: Array<any>, bStack: Array<any>): boolean {
   return true;
 }
 
-module.exports = areEqual;
+module.exports = areEqualArgValues;