relay-compiler 11.0.0 → 13.0.0-rc.0

package/lib/runner/BufferedFilesystem.js

@@ -1,261 +0,0 @@
-/**
- * Copyright (c) Facebook, Inc. and its affiliates.
- *
- * This source code is licensed under the MIT license found in the
- * LICENSE file in the root directory of this source tree.
- *
- * @emails oncall+relay
- * 
- * @format
- */
-// flowlint ambiguous-object-type:error
-'use strict';
-
-var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
-
-var _asyncToGenerator = require("@babel/runtime/helpers/asyncToGenerator");
-
-var _createForOfIteratorHelper2 = _interopRequireDefault(require("@babel/runtime/helpers/createForOfIteratorHelper"));
-
-var _defineProperty2 = _interopRequireDefault(require("@babel/runtime/helpers/defineProperty"));
-
-var fs = require('fs');
-
-var invariant = require("fbjs/lib/invariant");
-
-/**
- * A filesystem wrapper that buffers file reads and writes until `commit()` is
- * called.
- */
-var BufferedFilesystem = /*#__PURE__*/function () {
-  function BufferedFilesystem() {
-    (0, _defineProperty2["default"])(this, "buffer", new Map());
-    (0, _defineProperty2["default"])(this, "committed", false);
-  }
-
-  var _proto = BufferedFilesystem.prototype;
-
-  _proto._assertNotComitted = function _assertNotComitted() {
-    !!this.committed ? process.env.NODE_ENV !== "production" ? invariant(false, 'BufferedFilesystem: no operations allowed after commit().') : invariant(false) : void 0;
-  };
-
-  _proto.commit = /*#__PURE__*/function () {
-    var _commit = _asyncToGenerator(function* (sourceControl) {
-      this._assertNotComitted();
-
-      this.committed = true;
-      var removed = [];
-      var added = [];
-
-      var _iterator = (0, _createForOfIteratorHelper2["default"])(this.buffer),
-          _step;
-
-      try {
-        for (_iterator.s(); !(_step = _iterator.n()).done;) {
-          var _step$value = _step.value,
-              path = _step$value[0],
-              data = _step$value[1];
-
-          if (data == null) {
-            removed.push(path);
-            fs.unlinkSync(path);
-          } else {
-            var fileExisits = fs.existsSync(path);
-            var currentData = fileExisits ? fs.readFileSync(path, 'utf8') : null;
-
-            if (currentData !== data) {
-              added.push(path);
-              fs.writeFileSync(path, data, 'utf8');
-            }
-          }
-        }
-      } catch (err) {
-        _iterator.e(err);
-      } finally {
-        _iterator.f();
-      }
-
-      if (sourceControl) {
-        yield sourceControl.addRemove(added, removed);
-      }
-    });
-
-    function commit(_x) {
-      return _commit.apply(this, arguments);
-    }
-
-    return commit;
-  }();
-
-  _proto.hasChanges = function hasChanges() {
-    this._assertNotComitted();
-
-    return this.buffer.size > 0;
-  };
-
-  _proto.getChangesSummary = function getChangesSummary() {
-    this._assertNotComitted();
-
-    var added = [];
-    var updated = [];
-    var removed = [];
-
-    var _iterator2 = (0, _createForOfIteratorHelper2["default"])(this.buffer),
-        _step2;
-
-    try {
-      for (_iterator2.s(); !(_step2 = _iterator2.n()).done;) {
-        var _step2$value = _step2.value,
-            path = _step2$value[0],
-            data = _step2$value[1];
-
-        if (data == null) {
-          removed.push(path);
-        } else {
-          if (!fs.existsSync(path)) {
-            added.push(path);
-          } else {
-            updated.push(path);
-          }
-        }
-      }
-    } catch (err) {
-      _iterator2.e(err);
-    } finally {
-      _iterator2.f();
-    }
-
-    return [added.length > 0 ? "Added:\n".concat(added.map(formatFilepath).join('')) : '', updated.length > 0 ? "Updated:\n".concat(updated.map(formatFilepath).join('')) : '', removed.length > 0 ? "Removed:\n".concat(removed.map(formatFilepath).join('')) : ''].filter(Boolean).join('\n');
-  };
-
-  _proto.getAddedRemovedFiles = function getAddedRemovedFiles() {
-    this._assertNotComitted();
-
-    var added = [];
-    var removed = [];
-
-    var _iterator3 = (0, _createForOfIteratorHelper2["default"])(this.buffer),
-        _step3;
-
-    try {
-      for (_iterator3.s(); !(_step3 = _iterator3.n()).done;) {
-        var _step3$value = _step3.value,
-            path = _step3$value[0],
-            data = _step3$value[1];
-
-        if (data == null) {
-          removed.push(path);
-        } else {
-          if (!fs.existsSync(path)) {
-            added.push(path);
-          }
-        }
-      }
-    } catch (err) {
-      _iterator3.e(err);
-    } finally {
-      _iterator3.f();
-    }
-
-    return {
-      added: added,
-      removed: removed
-    };
-  };
-
-  _proto.existsSync = function existsSync(path) {
-    this._assertNotComitted();
-
-    return this.buffer.has(path) ? Boolean(this.buffer.get(path)) : fs.existsSync(path);
-  };
-
-  _proto.mkdirSync = function mkdirSync(path) {
-    this._assertNotComitted();
-
-    fs.mkdirSync(path);
-  };
-
-  _proto.readdirSync = function readdirSync(path) {
-    this._assertNotComitted();
-
-    throw new Error('BufferedFilesystem: readdirSync is not implemented.');
-  };
-
-  _proto.readFileSync = function readFileSync(path, encoding) {
-    this._assertNotComitted();
-
-    if (this.buffer.has(path)) {
-      var data = this.buffer.get(path);
-      !(data != null) ? process.env.NODE_ENV !== "production" ? invariant(false, 'BufferedFilesystem: trying to read deleted file.') : invariant(false) : void 0;
-      return data;
-    }
-
-    return fs.readFileSync(path, encoding);
-  };
-
-  _proto.statSync = function statSync(path) {
-    this._assertNotComitted();
-
-    return fs.statSync(path);
-  };
-
-  _proto.unlinkSync = function unlinkSync(path) {
-    this._assertNotComitted();
-
-    this.buffer.set(path, null);
-  };
-
-  _proto.writeFileSync = function writeFileSync(filename, data, encoding) {
-    this._assertNotComitted();
-
-    this.buffer.set(filename, data);
-  };
-
-  _proto.changedFilesToJSON = function changedFilesToJSON() {
-    this._assertNotComitted();
-
-    var changed = [];
-    var removed = [];
-
-    var _iterator4 = (0, _createForOfIteratorHelper2["default"])(this.buffer),
-        _step4;
-
-    try {
-      for (_iterator4.s(); !(_step4 = _iterator4.n()).done;) {
-        var _step4$value = _step4.value,
-            path = _step4$value[0],
-            data = _step4$value[1];
-
-        if (data == null) {
-          removed.push({
-            path: path
-          });
-        } else {
-          changed.push({
-            path: path,
-            data: data
-          });
-        }
-      }
-    } catch (err) {
-      _iterator4.e(err);
-    } finally {
-      _iterator4.f();
-    }
-
-    return {
-      removed: removed,
-      changed: changed
-    };
-  };
-
-  return BufferedFilesystem;
-}();
-
-function formatFilepath(filepath) {
-  var startIndex = filepath.length - 80;
-  var prefix = startIndex > 0 ? "\t - ".concat(filepath.substr(0, 8), "...") : '\t - ';
-  return prefix + filepath.substr(startIndex, filepath.length) + '\n';
-}
-
-module.exports = BufferedFilesystem;

package/lib/runner/GraphQLASTNodeGroup.js

@@ -1,256 +0,0 @@
-/**
- * Copyright (c) Facebook, Inc. and its affiliates.
- *
- * This source code is licensed under the MIT license found in the
- * LICENSE file in the root directory of this source tree.
- *
- * @format
- * 
- */
-// flowlint ambiguous-object-type:error
-'use strict';
-
-var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
-
-var _createForOfIteratorHelper2 = _interopRequireDefault(require("@babel/runtime/helpers/createForOfIteratorHelper"));
-
-var _toConsumableArray2 = _interopRequireDefault(require("@babel/runtime/helpers/toConsumableArray"));
-
-var GraphQLNodeMap = require('./GraphQLNodeMap');
-
-var _require = require('./GraphQLASTUtils'),
-    getName = _require.getName;
-
-var _require2 = require('graphql'),
-    visit = _require2.visit;
-
-function buildDependencyMap(nodes) {
-  var dependencyMap = new Map();
-
-  var _iterator = (0, _createForOfIteratorHelper2["default"])(nodes.values()),
-      _step;
-
-  try {
-    for (_iterator.s(); !(_step = _iterator.n()).done;) {
-      var node = _step.value;
-      var name = getName(node);
-
-      if (dependencyMap.has(name)) {
-        throw new Error("Duplicated definition for ".concat(name));
-      }
-
-      dependencyMap.set(name, findIncludedFragments(node));
-    }
-  } catch (err) {
-    _iterator.e(err);
-  } finally {
-    _iterator.f();
-  }
-
-  return dependencyMap;
-}
-
-function mergeMaps(maps) {
-  var result = new Map();
-
-  var _iterator2 = (0, _createForOfIteratorHelper2["default"])(maps),
-      _step2;
-
-  try {
-    for (_iterator2.s(); !(_step2 = _iterator2.n()).done;) {
-      var source = _step2.value;
-
-      var _iterator3 = (0, _createForOfIteratorHelper2["default"])(source.entries()),
-          _step3;
-
-      try {
-        for (_iterator3.s(); !(_step3 = _iterator3.n()).done;) {
-          var _step3$value = _step3.value,
-              key = _step3$value[0],
-              value = _step3$value[1];
-
-          if (result.has(key)) {
-            throw new Error("Duplicate entry for '".concat(key, "'."));
-          }
-
-          result.set(key, value);
-        }
-      } catch (err) {
-        _iterator3.e(err);
-      } finally {
-        _iterator3.f();
-      }
-    }
-  } catch (err) {
-    _iterator2.e(err);
-  } finally {
-    _iterator2.f();
-  }
-
-  return result;
-}
-
-function forFullBuild(nodes, baseNodes) {
-  var dependencyMap = mergeMaps([nodes].concat((0, _toConsumableArray2["default"])(baseNodes)).map(buildDependencyMap));
-  var includedNames = includeReachable(new Set(nodes.keys()), dependencyMap);
-  return buildResult(includedNames, nodes, mergeMaps(baseNodes));
-}
-
-function forChanges(nodes, changedNames) {
-  var baseNodes = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : [];
-  var projectDependencyMap = buildDependencyMap(nodes);
-  var baseDependencyMap = mergeMaps(baseNodes.map(buildDependencyMap));
-  var dependencyMap = mergeMaps([projectDependencyMap, baseDependencyMap]);
-  var invertedDependencyMap = inverseDependencyMap(dependencyMap);
-  var baseNameToNode = mergeMaps(baseNodes); // The first step of the process is to find all ancestors of changed nodes.
-  // And we perform this search on complete dependency map (project + base)
-
-  var directlyChangedAndAncestors = includeReachable(changedNames, invertedDependencyMap); // Now, we need to intersect obtained set with the project nodes
-
-  var directlyChangedRelatedToProject = new Set();
-
-  var _iterator4 = (0, _createForOfIteratorHelper2["default"])(directlyChangedAndAncestors),
-      _step4;
-
-  try {
-    for (_iterator4.s(); !(_step4 = _iterator4.n()).done;) {
-      var node = _step4.value;
-
-      if (nodes.has(node)) {
-        directlyChangedRelatedToProject.add(node);
-      }
-    } // Finally, we need to find all descendants of project-related changed nodes
-    // in the complete dependency map (project + base)
-
-  } catch (err) {
-    _iterator4.e(err);
-  } finally {
-    _iterator4.f();
-  }
-
-  var allRelated = includeReachable(directlyChangedRelatedToProject, dependencyMap);
-  return buildResult(allRelated, nodes, baseNameToNode);
-}
-
-function buildResult(includedNames, nameToNode, baseNameToNode) {
-  var baseNames = new Set();
-  var nodes = [];
-
-  var _iterator5 = (0, _createForOfIteratorHelper2["default"])(includedNames),
-      _step5;
-
-  try {
-    for (_iterator5.s(); !(_step5 = _iterator5.n()).done;) {
-      var name = _step5.value;
-      var baseNode = baseNameToNode.get(name);
-
-      if (baseNode != null) {
-        nodes.push(baseNode);
-        baseNames.add(name);
-      }
-
-      var node = nameToNode.get(name);
-
-      if (node != null) {
-        nodes.push(node);
-      }
-    }
-  } catch (err) {
-    _iterator5.e(err);
-  } finally {
-    _iterator5.f();
-  }
-
-  return {
-    baseNames: baseNames,
-    nodes: GraphQLNodeMap.from(nodes)
-  };
-}
-
-function includeReachable(changed, deps) {
-  var toVisit = Array.from(changed);
-  var visited = new Set();
-
-  while (toVisit.length > 0) {
-    var current = toVisit.pop();
-    visited.add(current);
-
-    var _iterator6 = (0, _createForOfIteratorHelper2["default"])(deps.get(current) || []),
-        _step6;
-
-    try {
-      for (_iterator6.s(); !(_step6 = _iterator6.n()).done;) {
-        var dep = _step6.value;
-
-        if (!visited.has(dep)) {
-          toVisit.push(dep);
-        }
-      }
-    } catch (err) {
-      _iterator6.e(err);
-    } finally {
-      _iterator6.f();
-    }
-  }
-
-  return visited;
-}
-
-function findIncludedFragments(node) {
-  var result = [];
-  visit(node, {
-    FragmentSpread: function FragmentSpread(spread) {
-      result.push(spread.name.value);
-    }
-  });
-  return result;
-}
-
-function inverseDependencyMap(map) {
-  var invertedMap = new Map();
-
-  var _iterator7 = (0, _createForOfIteratorHelper2["default"])(map.entries()),
-      _step7;
-
-  try {
-    for (_iterator7.s(); !(_step7 = _iterator7.n()).done;) {
-      var _step7$value = _step7.value,
-          source = _step7$value[0],
-          dests = _step7$value[1];
-      var inverseDest = source;
-
-      var _iterator8 = (0, _createForOfIteratorHelper2["default"])(dests),
-          _step8;
-
-      try {
-        for (_iterator8.s(); !(_step8 = _iterator8.n()).done;) {
-          var dest = _step8.value;
-          var inverseSource = dest;
-          var inverseDests = invertedMap.get(inverseSource);
-
-          if (inverseDests == null) {
-            inverseDests = [];
-            invertedMap.set(inverseSource, inverseDests);
-          }
-
-          inverseDests.push(inverseDest);
-        }
-      } catch (err) {
-        _iterator8.e(err);
-      } finally {
-        _iterator8.f();
-      }
-    }
-  } catch (err) {
-    _iterator7.e(err);
-  } finally {
-    _iterator7.f();
-  }
-
-  return invertedMap;
-}
-
-module.exports = {
-  forChanges: forChanges,
-  forFullBuild: forFullBuild
-};

package/lib/runner/GraphQLASTUtils.js

@@ -1,23 +0,0 @@
-/**
- * Copyright (c) Facebook, Inc. and its affiliates.
- *
- * This source code is licensed under the MIT license found in the
- * LICENSE file in the root directory of this source tree.
- *
- * @format
- * 
- */
-// flowlint ambiguous-object-type:error
-'use strict';
-
-function getName(node) {
-  if (node.name == null) {
-    throw new Error('All fragments and operations have to have names in Relay');
-  }
-
-  return node.name.value;
-}
-
-module.exports = {
-  getName: getName
-};

package/lib/runner/GraphQLNodeMap.js

@@ -1,81 +0,0 @@
-/**
- * Copyright (c) Facebook, Inc. and its affiliates.
- *
- * This source code is licensed under the MIT license found in the
- * LICENSE file in the root directory of this source tree.
- *
- * @format
- * 
- */
-// flowlint ambiguous-object-type:error
-'use strict';
-
-var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
-
-var _createForOfIteratorHelper2 = _interopRequireDefault(require("@babel/runtime/helpers/createForOfIteratorHelper"));
-
-var _inheritsLoose2 = _interopRequireDefault(require("@babel/runtime/helpers/inheritsLoose"));
-
-var _wrapNativeSuper2 = _interopRequireDefault(require("@babel/runtime/helpers/wrapNativeSuper"));
-
-var _require = require('../core/CompilerError'),
-    createUserError = _require.createUserError,
-    createCompilerError = _require.createCompilerError;
-
-var _require2 = require('./GraphQLASTUtils'),
-    getName = _require2.getName;
-
-var GraphQLNodeMap = /*#__PURE__*/function (_Map) {
-  (0, _inheritsLoose2["default"])(GraphQLNodeMap, _Map);
-
-  function GraphQLNodeMap() {
-    return _Map.apply(this, arguments) || this;
-  }
-
-  GraphQLNodeMap.from = function from(nodes) {
-    var result = new GraphQLNodeMap();
-
-    var _iterator = (0, _createForOfIteratorHelper2["default"])(nodes),
-        _step;
-
-    try {
-      for (_iterator.s(); !(_step = _iterator.n()).done;) {
-        var node = _step.value;
-        var name = getName(node);
-        var prevNode = result.get(name);
-
-        if (prevNode) {
-          throw createUserError("Duplicate node named '".concat(name, "'"), null, [node, prevNode]);
-        }
-
-        result.set(name, node);
-      }
-    } catch (err) {
-      _iterator.e(err);
-    } finally {
-      _iterator.f();
-    }
-
-    return result;
-  };
-
-  GraphQLNodeMap.fromSources = function fromSources(sources) {
-    return GraphQLNodeMap.from(sources.nodes());
-  };
-
-  var _proto = GraphQLNodeMap.prototype;
-
-  _proto.enforceGet = function enforceGet(name) {
-    var node = this.get(name);
-
-    if (!node) {
-      throw createCompilerError("GraphQLNodeMap: expected to have a node named ".concat(name, "."));
-    }
-
-    return node;
-  };
-
-  return GraphQLNodeMap;
-}( /*#__PURE__*/(0, _wrapNativeSuper2["default"])(Map));
-
-module.exports = GraphQLNodeMap;